./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/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 5d1ed5f95c4e8acd6cf76ffe908c8c8bb3dc8352 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/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 5d1ed5f95c4e8acd6cf76ffe908c8c8bb3dc8352 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:56:15,230 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:56:15,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:56:15,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:56:15,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:56:15,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:56:15,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:56:15,242 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:56:15,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:56:15,244 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:56:15,244 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:56:15,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:56:15,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:56:15,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:56:15,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:56:15,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:56:15,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:56:15,249 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:56:15,250 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:56:15,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:56:15,252 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:56:15,253 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:56:15,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:56:15,254 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:56:15,256 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:56:15,256 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:56:15,256 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:56:15,257 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:56:15,257 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:56:15,258 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:56:15,258 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:56:15,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:56:15,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:56:15,259 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:56:15,260 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:56:15,260 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:56:15,260 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:56:15,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:56:15,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:56:15,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:56:15,261 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:56:15,262 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:56:15,271 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:56:15,272 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:56:15,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:56:15,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:56:15,273 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:56:15,273 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:56:15,273 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:56:15,273 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:56:15,273 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:56:15,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:56:15,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:56:15,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:56:15,274 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:56:15,274 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:56:15,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:56:15,274 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:56:15,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:56:15,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:56:15,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:56:15,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:56:15,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:56:15,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:56:15,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:56:15,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:56:15,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:56:15,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:56:15,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:56:15,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:56:15,276 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:56:15,276 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_c0f11647-7c8c-4763-8c90-029d87d55532/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 -> 5d1ed5f95c4e8acd6cf76ffe908c8c8bb3dc8352 [2019-12-07 17:56:15,376 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:56:15,386 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:56:15,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:56:15,389 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:56:15,390 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:56:15,391 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c [2019-12-07 17:56:15,439 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/data/f97fbfbee/d73ff3f33fe34a8787ae593bc45ffe98/FLAG4caf6a631 [2019-12-07 17:56:15,923 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:56:15,923 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c [2019-12-07 17:56:15,936 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/data/f97fbfbee/d73ff3f33fe34a8787ae593bc45ffe98/FLAG4caf6a631 [2019-12-07 17:56:15,944 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/data/f97fbfbee/d73ff3f33fe34a8787ae593bc45ffe98 [2019-12-07 17:56:15,946 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:56:15,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:56:15,948 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:56:15,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:56:15,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:56:15,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:56:15" (1/1) ... [2019-12-07 17:56:15,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a30f84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:15, skipping insertion in model container [2019-12-07 17:56:15,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:56:15" (1/1) ... [2019-12-07 17:56:15,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:56:15,994 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:56:16,276 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:56:16,287 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:56:16,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:56:16,389 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:56:16,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16 WrapperNode [2019-12-07 17:56:16,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:56:16,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:56:16,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:56:16,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:56:16,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (1/1) ... [2019-12-07 17:56:16,417 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (1/1) ... [2019-12-07 17:56:16,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:56:16,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:56:16,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:56:16,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:56:16,464 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (1/1) ... [2019-12-07 17:56:16,464 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (1/1) ... [2019-12-07 17:56:16,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (1/1) ... [2019-12-07 17:56:16,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (1/1) ... [2019-12-07 17:56:16,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (1/1) ... [2019-12-07 17:56:16,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (1/1) ... [2019-12-07 17:56:16,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (1/1) ... [2019-12-07 17:56:16,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:56:16,516 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:56:16,516 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:56:16,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:56:16,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:56:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:56:16,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:56:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:56:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:56:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:56:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:56:16,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:56:16,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:56:16,671 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:56:17,213 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 17:56:17,213 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 17:56:17,214 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:56:17,214 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:56:17,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:56:17 BoogieIcfgContainer [2019-12-07 17:56:17,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:56:17,216 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:56:17,216 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:56:17,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:56:17,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:56:15" (1/3) ... [2019-12-07 17:56:17,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e01580a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:56:17, skipping insertion in model container [2019-12-07 17:56:17,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:56:16" (2/3) ... [2019-12-07 17:56:17,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e01580a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:56:17, skipping insertion in model container [2019-12-07 17:56:17,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:56:17" (3/3) ... [2019-12-07 17:56:17,220 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2019-12-07 17:56:17,226 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:56:17,231 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:56:17,238 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:56:17,254 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:56:17,254 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:56:17,254 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:56:17,254 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:56:17,254 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:56:17,254 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:56:17,255 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:56:17,255 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:56:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2019-12-07 17:56:17,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:56:17,273 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:17,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:17,274 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:17,278 INFO L82 PathProgramCache]: Analyzing trace with hash 102131673, now seen corresponding path program 1 times [2019-12-07 17:56:17,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:17,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883635331] [2019-12-07 17:56:17,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:17,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:17,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883635331] [2019-12-07 17:56:17,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:17,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:17,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407818962] [2019-12-07 17:56:17,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:17,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:17,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:17,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:17,494 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 4 states. [2019-12-07 17:56:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:17,800 INFO L93 Difference]: Finished difference Result 339 states and 579 transitions. [2019-12-07 17:56:17,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:17,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-07 17:56:17,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:17,811 INFO L225 Difference]: With dead ends: 339 [2019-12-07 17:56:17,811 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 17:56:17,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 17:56:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2019-12-07 17:56:17,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:56:17,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 242 transitions. [2019-12-07 17:56:17,849 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 242 transitions. Word has length 43 [2019-12-07 17:56:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:17,849 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 242 transitions. [2019-12-07 17:56:17,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 242 transitions. [2019-12-07 17:56:17,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:56:17,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:17,851 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:17,852 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:17,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:17,852 INFO L82 PathProgramCache]: Analyzing trace with hash 862077968, now seen corresponding path program 1 times [2019-12-07 17:56:17,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:17,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851170602] [2019-12-07 17:56:17,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:17,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851170602] [2019-12-07 17:56:17,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:17,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:17,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387420008] [2019-12-07 17:56:17,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:17,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:17,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:17,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:17,934 INFO L87 Difference]: Start difference. First operand 154 states and 242 transitions. Second operand 4 states. [2019-12-07 17:56:18,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:18,159 INFO L93 Difference]: Finished difference Result 306 states and 475 transitions. [2019-12-07 17:56:18,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:18,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-12-07 17:56:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:18,161 INFO L225 Difference]: With dead ends: 306 [2019-12-07 17:56:18,161 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 17:56:18,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:18,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 17:56:18,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2019-12-07 17:56:18,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:56:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 241 transitions. [2019-12-07 17:56:18,171 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 241 transitions. Word has length 56 [2019-12-07 17:56:18,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:18,171 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 241 transitions. [2019-12-07 17:56:18,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:18,171 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 241 transitions. [2019-12-07 17:56:18,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:56:18,173 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:18,173 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:18,173 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:18,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1995784866, now seen corresponding path program 1 times [2019-12-07 17:56:18,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:18,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880429014] [2019-12-07 17:56:18,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:18,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:18,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:18,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880429014] [2019-12-07 17:56:18,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:18,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:18,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881231878] [2019-12-07 17:56:18,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:18,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:18,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:18,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:18,239 INFO L87 Difference]: Start difference. First operand 154 states and 241 transitions. Second operand 4 states. [2019-12-07 17:56:18,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:18,472 INFO L93 Difference]: Finished difference Result 305 states and 473 transitions. [2019-12-07 17:56:18,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:18,472 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:56:18,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:18,474 INFO L225 Difference]: With dead ends: 305 [2019-12-07 17:56:18,474 INFO L226 Difference]: Without dead ends: 170 [2019-12-07 17:56:18,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:18,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-12-07 17:56:18,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 154. [2019-12-07 17:56:18,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:56:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 240 transitions. [2019-12-07 17:56:18,485 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 240 transitions. Word has length 57 [2019-12-07 17:56:18,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:18,485 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 240 transitions. [2019-12-07 17:56:18,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 240 transitions. [2019-12-07 17:56:18,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:56:18,488 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:18,488 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:18,488 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:18,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:18,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1027351245, now seen corresponding path program 1 times [2019-12-07 17:56:18,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:18,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527208416] [2019-12-07 17:56:18,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:18,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527208416] [2019-12-07 17:56:18,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:18,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:18,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527067173] [2019-12-07 17:56:18,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:18,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:18,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:18,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:18,549 INFO L87 Difference]: Start difference. First operand 154 states and 240 transitions. Second operand 4 states. [2019-12-07 17:56:18,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:18,740 INFO L93 Difference]: Finished difference Result 303 states and 470 transitions. [2019-12-07 17:56:18,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:18,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:56:18,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:18,742 INFO L225 Difference]: With dead ends: 303 [2019-12-07 17:56:18,742 INFO L226 Difference]: Without dead ends: 168 [2019-12-07 17:56:18,743 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-12-07 17:56:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 154. [2019-12-07 17:56:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:56:18,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 239 transitions. [2019-12-07 17:56:18,748 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 239 transitions. Word has length 57 [2019-12-07 17:56:18,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:18,748 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 239 transitions. [2019-12-07 17:56:18,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 239 transitions. [2019-12-07 17:56:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:56:18,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:18,750 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:18,750 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:18,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:18,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1264395763, now seen corresponding path program 1 times [2019-12-07 17:56:18,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:18,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009364692] [2019-12-07 17:56:18,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:18,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:18,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009364692] [2019-12-07 17:56:18,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:18,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:18,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64213998] [2019-12-07 17:56:18,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:18,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:18,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:18,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:18,793 INFO L87 Difference]: Start difference. First operand 154 states and 239 transitions. Second operand 4 states. [2019-12-07 17:56:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:18,986 INFO L93 Difference]: Finished difference Result 302 states and 468 transitions. [2019-12-07 17:56:18,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:18,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:56:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:18,987 INFO L225 Difference]: With dead ends: 302 [2019-12-07 17:56:18,987 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 17:56:18,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:18,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 17:56:18,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2019-12-07 17:56:18,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:56:18,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 238 transitions. [2019-12-07 17:56:18,993 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 238 transitions. Word has length 57 [2019-12-07 17:56:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:18,994 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 238 transitions. [2019-12-07 17:56:18,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:18,994 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 238 transitions. [2019-12-07 17:56:18,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:56:18,994 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:18,994 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:18,995 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:18,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:18,995 INFO L82 PathProgramCache]: Analyzing trace with hash -412278986, now seen corresponding path program 1 times [2019-12-07 17:56:18,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:18,995 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655579096] [2019-12-07 17:56:18,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:19,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:19,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655579096] [2019-12-07 17:56:19,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:19,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:19,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734062810] [2019-12-07 17:56:19,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:19,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:19,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:19,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:19,039 INFO L87 Difference]: Start difference. First operand 154 states and 238 transitions. Second operand 4 states. [2019-12-07 17:56:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:19,225 INFO L93 Difference]: Finished difference Result 302 states and 467 transitions. [2019-12-07 17:56:19,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:19,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:56:19,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:19,227 INFO L225 Difference]: With dead ends: 302 [2019-12-07 17:56:19,227 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 17:56:19,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:19,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 17:56:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2019-12-07 17:56:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:56:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 237 transitions. [2019-12-07 17:56:19,232 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 237 transitions. Word has length 57 [2019-12-07 17:56:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:19,232 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 237 transitions. [2019-12-07 17:56:19,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 237 transitions. [2019-12-07 17:56:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:56:19,233 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:19,233 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:19,233 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:19,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:19,234 INFO L82 PathProgramCache]: Analyzing trace with hash 728780505, now seen corresponding path program 1 times [2019-12-07 17:56:19,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:19,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096654505] [2019-12-07 17:56:19,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:19,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:19,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096654505] [2019-12-07 17:56:19,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:19,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:19,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876623067] [2019-12-07 17:56:19,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:19,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:19,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:19,277 INFO L87 Difference]: Start difference. First operand 154 states and 237 transitions. Second operand 4 states. [2019-12-07 17:56:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:19,478 INFO L93 Difference]: Finished difference Result 302 states and 466 transitions. [2019-12-07 17:56:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:19,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-07 17:56:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:19,479 INFO L225 Difference]: With dead ends: 302 [2019-12-07 17:56:19,479 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 17:56:19,480 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:19,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 17:56:19,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2019-12-07 17:56:19,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:56:19,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 236 transitions. [2019-12-07 17:56:19,484 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 236 transitions. Word has length 58 [2019-12-07 17:56:19,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:19,485 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 236 transitions. [2019-12-07 17:56:19,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 236 transitions. [2019-12-07 17:56:19,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 17:56:19,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:19,485 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:19,485 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:19,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:19,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1288318245, now seen corresponding path program 1 times [2019-12-07 17:56:19,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:19,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667601216] [2019-12-07 17:56:19,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:19,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667601216] [2019-12-07 17:56:19,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:19,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:19,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37029061] [2019-12-07 17:56:19,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:19,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:19,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:19,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:19,530 INFO L87 Difference]: Start difference. First operand 154 states and 236 transitions. Second operand 4 states. [2019-12-07 17:56:19,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:19,726 INFO L93 Difference]: Finished difference Result 302 states and 465 transitions. [2019-12-07 17:56:19,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:19,726 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2019-12-07 17:56:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:19,727 INFO L225 Difference]: With dead ends: 302 [2019-12-07 17:56:19,727 INFO L226 Difference]: Without dead ends: 167 [2019-12-07 17:56:19,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:19,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-12-07 17:56:19,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 154. [2019-12-07 17:56:19,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:56:19,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 235 transitions. [2019-12-07 17:56:19,731 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 235 transitions. Word has length 59 [2019-12-07 17:56:19,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:19,731 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 235 transitions. [2019-12-07 17:56:19,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:19,731 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 235 transitions. [2019-12-07 17:56:19,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:56:19,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:19,732 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:19,732 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:19,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1870892638, now seen corresponding path program 1 times [2019-12-07 17:56:19,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:19,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647058231] [2019-12-07 17:56:19,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:19,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647058231] [2019-12-07 17:56:19,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:19,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:19,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973264005] [2019-12-07 17:56:19,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:19,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:19,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:19,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:19,766 INFO L87 Difference]: Start difference. First operand 154 states and 235 transitions. Second operand 4 states. [2019-12-07 17:56:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:19,931 INFO L93 Difference]: Finished difference Result 292 states and 451 transitions. [2019-12-07 17:56:19,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:19,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 17:56:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:19,932 INFO L225 Difference]: With dead ends: 292 [2019-12-07 17:56:19,932 INFO L226 Difference]: Without dead ends: 157 [2019-12-07 17:56:19,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:19,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-12-07 17:56:19,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2019-12-07 17:56:19,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:56:19,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 234 transitions. [2019-12-07 17:56:19,936 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 234 transitions. Word has length 60 [2019-12-07 17:56:19,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:19,936 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 234 transitions. [2019-12-07 17:56:19,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 234 transitions. [2019-12-07 17:56:19,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:56:19,936 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:19,937 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:19,937 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:19,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:19,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1259019206, now seen corresponding path program 1 times [2019-12-07 17:56:19,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:19,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964143736] [2019-12-07 17:56:19,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:19,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:19,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964143736] [2019-12-07 17:56:19,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:19,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:19,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439355936] [2019-12-07 17:56:19,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:19,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:19,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:19,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:19,969 INFO L87 Difference]: Start difference. First operand 154 states and 234 transitions. Second operand 4 states. [2019-12-07 17:56:20,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:20,181 INFO L93 Difference]: Finished difference Result 332 states and 512 transitions. [2019-12-07 17:56:20,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:20,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 17:56:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:20,183 INFO L225 Difference]: With dead ends: 332 [2019-12-07 17:56:20,184 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 17:56:20,184 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-12-07 17:56:20,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 17:56:20,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 176. [2019-12-07 17:56:20,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:56:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 272 transitions. [2019-12-07 17:56:20,190 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 272 transitions. Word has length 60 [2019-12-07 17:56:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:20,190 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 272 transitions. [2019-12-07 17:56:20,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 272 transitions. [2019-12-07 17:56:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 17:56:20,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:20,191 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:20,191 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:20,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:20,192 INFO L82 PathProgramCache]: Analyzing trace with hash -918808253, now seen corresponding path program 1 times [2019-12-07 17:56:20,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:20,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81852128] [2019-12-07 17:56:20,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:20,229 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:20,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81852128] [2019-12-07 17:56:20,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:20,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:20,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117546989] [2019-12-07 17:56:20,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:20,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:20,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:20,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:20,231 INFO L87 Difference]: Start difference. First operand 176 states and 272 transitions. Second operand 4 states. [2019-12-07 17:56:20,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:20,445 INFO L93 Difference]: Finished difference Result 354 states and 549 transitions. [2019-12-07 17:56:20,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:20,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 17:56:20,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:20,446 INFO L225 Difference]: With dead ends: 354 [2019-12-07 17:56:20,446 INFO L226 Difference]: Without dead ends: 197 [2019-12-07 17:56:20,447 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-12-07 17:56:20,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-12-07 17:56:20,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 176. [2019-12-07 17:56:20,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:56:20,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 271 transitions. [2019-12-07 17:56:20,451 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 271 transitions. Word has length 73 [2019-12-07 17:56:20,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:20,451 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 271 transitions. [2019-12-07 17:56:20,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:20,451 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 271 transitions. [2019-12-07 17:56:20,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:56:20,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:20,452 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:20,452 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:20,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:20,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1672080433, now seen corresponding path program 1 times [2019-12-07 17:56:20,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:20,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180184894] [2019-12-07 17:56:20,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:20,485 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:20,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180184894] [2019-12-07 17:56:20,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:20,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:20,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681733089] [2019-12-07 17:56:20,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:20,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:20,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:20,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:20,486 INFO L87 Difference]: Start difference. First operand 176 states and 271 transitions. Second operand 4 states. [2019-12-07 17:56:20,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:20,753 INFO L93 Difference]: Finished difference Result 353 states and 546 transitions. [2019-12-07 17:56:20,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:20,754 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:56:20,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:20,755 INFO L225 Difference]: With dead ends: 353 [2019-12-07 17:56:20,755 INFO L226 Difference]: Without dead ends: 196 [2019-12-07 17:56:20,755 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-12-07 17:56:20,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-12-07 17:56:20,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 176. [2019-12-07 17:56:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:56:20,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 270 transitions. [2019-12-07 17:56:20,759 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 270 transitions. Word has length 74 [2019-12-07 17:56:20,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:20,759 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 270 transitions. [2019-12-07 17:56:20,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:20,759 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 270 transitions. [2019-12-07 17:56:20,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:56:20,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:20,760 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:20,760 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:20,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1654453242, now seen corresponding path program 1 times [2019-12-07 17:56:20,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:20,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420374924] [2019-12-07 17:56:20,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:20,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:20,789 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:20,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420374924] [2019-12-07 17:56:20,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:20,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:20,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152438105] [2019-12-07 17:56:20,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:20,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:20,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:20,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:20,791 INFO L87 Difference]: Start difference. First operand 176 states and 270 transitions. Second operand 4 states. [2019-12-07 17:56:20,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:20,998 INFO L93 Difference]: Finished difference Result 351 states and 542 transitions. [2019-12-07 17:56:20,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:20,998 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:56:20,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:20,999 INFO L225 Difference]: With dead ends: 351 [2019-12-07 17:56:21,000 INFO L226 Difference]: Without dead ends: 194 [2019-12-07 17:56:21,000 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-12-07 17:56:21,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-12-07 17:56:21,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2019-12-07 17:56:21,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:56:21,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 269 transitions. [2019-12-07 17:56:21,004 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 269 transitions. Word has length 74 [2019-12-07 17:56:21,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:21,004 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 269 transitions. [2019-12-07 17:56:21,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:21,004 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 269 transitions. [2019-12-07 17:56:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:56:21,005 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:21,005 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:21,005 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:21,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:21,005 INFO L82 PathProgramCache]: Analyzing trace with hash -637293766, now seen corresponding path program 1 times [2019-12-07 17:56:21,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:21,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333352979] [2019-12-07 17:56:21,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:21,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333352979] [2019-12-07 17:56:21,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:21,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:21,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45452239] [2019-12-07 17:56:21,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:21,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:21,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:21,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:21,039 INFO L87 Difference]: Start difference. First operand 176 states and 269 transitions. Second operand 4 states. [2019-12-07 17:56:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:21,288 INFO L93 Difference]: Finished difference Result 350 states and 539 transitions. [2019-12-07 17:56:21,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:21,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:56:21,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:21,289 INFO L225 Difference]: With dead ends: 350 [2019-12-07 17:56:21,289 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 17:56:21,290 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-12-07 17:56:21,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 17:56:21,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2019-12-07 17:56:21,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:56:21,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 268 transitions. [2019-12-07 17:56:21,293 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 268 transitions. Word has length 74 [2019-12-07 17:56:21,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:21,293 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 268 transitions. [2019-12-07 17:56:21,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 268 transitions. [2019-12-07 17:56:21,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 17:56:21,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:21,294 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:21,294 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:21,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:21,294 INFO L82 PathProgramCache]: Analyzing trace with hash 214823011, now seen corresponding path program 1 times [2019-12-07 17:56:21,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:21,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629156019] [2019-12-07 17:56:21,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:21,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:21,320 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:21,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629156019] [2019-12-07 17:56:21,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:21,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:21,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78137428] [2019-12-07 17:56:21,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:21,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:21,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:21,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:21,321 INFO L87 Difference]: Start difference. First operand 176 states and 268 transitions. Second operand 4 states. [2019-12-07 17:56:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:21,524 INFO L93 Difference]: Finished difference Result 350 states and 537 transitions. [2019-12-07 17:56:21,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:21,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-07 17:56:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:21,526 INFO L225 Difference]: With dead ends: 350 [2019-12-07 17:56:21,526 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 17:56:21,526 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-12-07 17:56:21,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 17:56:21,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2019-12-07 17:56:21,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:56:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 267 transitions. [2019-12-07 17:56:21,530 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 267 transitions. Word has length 74 [2019-12-07 17:56:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:21,531 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 267 transitions. [2019-12-07 17:56:21,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 267 transitions. [2019-12-07 17:56:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 17:56:21,531 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:21,532 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:21,532 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:21,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:21,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1305894068, now seen corresponding path program 1 times [2019-12-07 17:56:21,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:21,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839287172] [2019-12-07 17:56:21,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:21,566 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:21,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839287172] [2019-12-07 17:56:21,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:21,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:21,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721383867] [2019-12-07 17:56:21,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:21,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:21,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:21,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:21,567 INFO L87 Difference]: Start difference. First operand 176 states and 267 transitions. Second operand 4 states. [2019-12-07 17:56:21,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:21,800 INFO L93 Difference]: Finished difference Result 350 states and 535 transitions. [2019-12-07 17:56:21,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:21,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 17:56:21,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:21,801 INFO L225 Difference]: With dead ends: 350 [2019-12-07 17:56:21,802 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 17:56:21,802 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-12-07 17:56:21,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 17:56:21,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2019-12-07 17:56:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:56:21,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 266 transitions. [2019-12-07 17:56:21,806 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 266 transitions. Word has length 75 [2019-12-07 17:56:21,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:21,806 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 266 transitions. [2019-12-07 17:56:21,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:21,806 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 266 transitions. [2019-12-07 17:56:21,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 17:56:21,807 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:21,807 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:21,807 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:21,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:21,807 INFO L82 PathProgramCache]: Analyzing trace with hash 61279432, now seen corresponding path program 1 times [2019-12-07 17:56:21,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:21,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344350771] [2019-12-07 17:56:21,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:21,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344350771] [2019-12-07 17:56:21,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:21,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:21,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92979758] [2019-12-07 17:56:21,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:21,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:21,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:21,842 INFO L87 Difference]: Start difference. First operand 176 states and 266 transitions. Second operand 4 states. [2019-12-07 17:56:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:22,082 INFO L93 Difference]: Finished difference Result 350 states and 533 transitions. [2019-12-07 17:56:22,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:22,082 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-12-07 17:56:22,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:22,083 INFO L225 Difference]: With dead ends: 350 [2019-12-07 17:56:22,083 INFO L226 Difference]: Without dead ends: 193 [2019-12-07 17:56:22,084 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-12-07 17:56:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-12-07 17:56:22,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 176. [2019-12-07 17:56:22,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:56:22,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 265 transitions. [2019-12-07 17:56:22,087 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 265 transitions. Word has length 76 [2019-12-07 17:56:22,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:22,088 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 265 transitions. [2019-12-07 17:56:22,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:22,088 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 265 transitions. [2019-12-07 17:56:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 17:56:22,088 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:22,089 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:22,089 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash 758747665, now seen corresponding path program 1 times [2019-12-07 17:56:22,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:22,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393373006] [2019-12-07 17:56:22,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:56:22,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393373006] [2019-12-07 17:56:22,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:22,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:22,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407088811] [2019-12-07 17:56:22,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:22,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:22,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:22,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:22,129 INFO L87 Difference]: Start difference. First operand 176 states and 265 transitions. Second operand 4 states. [2019-12-07 17:56:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:22,317 INFO L93 Difference]: Finished difference Result 340 states and 518 transitions. [2019-12-07 17:56:22,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:22,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 17:56:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:22,318 INFO L225 Difference]: With dead ends: 340 [2019-12-07 17:56:22,318 INFO L226 Difference]: Without dead ends: 183 [2019-12-07 17:56:22,318 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-12-07 17:56:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2019-12-07 17:56:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 176. [2019-12-07 17:56:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-12-07 17:56:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 264 transitions. [2019-12-07 17:56:22,322 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 264 transitions. Word has length 77 [2019-12-07 17:56:22,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:22,322 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 264 transitions. [2019-12-07 17:56:22,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 264 transitions. [2019-12-07 17:56:22,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 17:56:22,323 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:22,323 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:22,323 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:22,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:22,324 INFO L82 PathProgramCache]: Analyzing trace with hash -650021911, now seen corresponding path program 1 times [2019-12-07 17:56:22,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:22,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528655448] [2019-12-07 17:56:22,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:22,379 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:22,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528655448] [2019-12-07 17:56:22,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:22,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:22,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543471089] [2019-12-07 17:56:22,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:22,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:22,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:22,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:22,380 INFO L87 Difference]: Start difference. First operand 176 states and 264 transitions. Second operand 4 states. [2019-12-07 17:56:22,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:22,675 INFO L93 Difference]: Finished difference Result 446 states and 683 transitions. [2019-12-07 17:56:22,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:22,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 17:56:22,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:22,677 INFO L225 Difference]: With dead ends: 446 [2019-12-07 17:56:22,677 INFO L226 Difference]: Without dead ends: 289 [2019-12-07 17:56:22,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:22,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-12-07 17:56:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 217. [2019-12-07 17:56:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-12-07 17:56:22,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 338 transitions. [2019-12-07 17:56:22,681 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 338 transitions. Word has length 82 [2019-12-07 17:56:22,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:22,681 INFO L462 AbstractCegarLoop]: Abstraction has 217 states and 338 transitions. [2019-12-07 17:56:22,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:22,681 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 338 transitions. [2019-12-07 17:56:22,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-07 17:56:22,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:22,682 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:22,682 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:22,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash -226375189, now seen corresponding path program 1 times [2019-12-07 17:56:22,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:22,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855622302] [2019-12-07 17:56:22,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:22,720 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:22,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855622302] [2019-12-07 17:56:22,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:22,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:22,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154324206] [2019-12-07 17:56:22,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:22,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:22,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:22,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:22,721 INFO L87 Difference]: Start difference. First operand 217 states and 338 transitions. Second operand 4 states. [2019-12-07 17:56:23,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:23,008 INFO L93 Difference]: Finished difference Result 465 states and 731 transitions. [2019-12-07 17:56:23,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:23,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-12-07 17:56:23,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:23,009 INFO L225 Difference]: With dead ends: 465 [2019-12-07 17:56:23,009 INFO L226 Difference]: Without dead ends: 267 [2019-12-07 17:56:23,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:23,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-12-07 17:56:23,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 241. [2019-12-07 17:56:23,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 17:56:23,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 380 transitions. [2019-12-07 17:56:23,014 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 380 transitions. Word has length 82 [2019-12-07 17:56:23,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:23,014 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 380 transitions. [2019-12-07 17:56:23,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:23,014 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 380 transitions. [2019-12-07 17:56:23,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-07 17:56:23,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:23,015 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:23,015 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:23,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1857859097, now seen corresponding path program 1 times [2019-12-07 17:56:23,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:23,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081131222] [2019-12-07 17:56:23,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:23,057 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:23,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081131222] [2019-12-07 17:56:23,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:23,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:23,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958930841] [2019-12-07 17:56:23,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:23,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:23,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:23,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:23,058 INFO L87 Difference]: Start difference. First operand 241 states and 380 transitions. Second operand 4 states. [2019-12-07 17:56:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:23,348 INFO L93 Difference]: Finished difference Result 527 states and 829 transitions. [2019-12-07 17:56:23,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:23,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-12-07 17:56:23,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:23,350 INFO L225 Difference]: With dead ends: 527 [2019-12-07 17:56:23,350 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 17:56:23,350 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:23,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 17:56:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 242. [2019-12-07 17:56:23,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 17:56:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 381 transitions. [2019-12-07 17:56:23,354 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 381 transitions. Word has length 83 [2019-12-07 17:56:23,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:23,354 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 381 transitions. [2019-12-07 17:56:23,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:23,354 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 381 transitions. [2019-12-07 17:56:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 17:56:23,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:23,355 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:23,355 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:23,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1587064320, now seen corresponding path program 1 times [2019-12-07 17:56:23,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:23,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842556654] [2019-12-07 17:56:23,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:23,392 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:23,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842556654] [2019-12-07 17:56:23,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:23,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:23,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794867754] [2019-12-07 17:56:23,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:23,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:23,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:23,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:23,394 INFO L87 Difference]: Start difference. First operand 242 states and 381 transitions. Second operand 4 states. [2019-12-07 17:56:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:23,698 INFO L93 Difference]: Finished difference Result 528 states and 829 transitions. [2019-12-07 17:56:23,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:23,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 17:56:23,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:23,699 INFO L225 Difference]: With dead ends: 528 [2019-12-07 17:56:23,699 INFO L226 Difference]: Without dead ends: 305 [2019-12-07 17:56:23,700 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:23,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-12-07 17:56:23,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 242. [2019-12-07 17:56:23,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 17:56:23,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 380 transitions. [2019-12-07 17:56:23,704 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 380 transitions. Word has length 95 [2019-12-07 17:56:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:23,704 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 380 transitions. [2019-12-07 17:56:23,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 380 transitions. [2019-12-07 17:56:23,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-07 17:56:23,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:23,705 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:23,705 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:23,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:23,705 INFO L82 PathProgramCache]: Analyzing trace with hash -711045314, now seen corresponding path program 1 times [2019-12-07 17:56:23,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:23,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442900561] [2019-12-07 17:56:23,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:23,738 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:23,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442900561] [2019-12-07 17:56:23,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:23,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:23,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738918664] [2019-12-07 17:56:23,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:23,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:23,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:23,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:23,739 INFO L87 Difference]: Start difference. First operand 242 states and 380 transitions. Second operand 4 states. [2019-12-07 17:56:23,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:23,985 INFO L93 Difference]: Finished difference Result 491 states and 772 transitions. [2019-12-07 17:56:23,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:23,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-07 17:56:23,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:23,987 INFO L225 Difference]: With dead ends: 491 [2019-12-07 17:56:23,987 INFO L226 Difference]: Without dead ends: 268 [2019-12-07 17:56:23,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:23,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-12-07 17:56:23,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 242. [2019-12-07 17:56:23,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 17:56:23,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 379 transitions. [2019-12-07 17:56:23,991 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 379 transitions. Word has length 95 [2019-12-07 17:56:23,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:23,991 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 379 transitions. [2019-12-07 17:56:23,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:23,991 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 379 transitions. [2019-12-07 17:56:23,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:56:23,991 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:23,992 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:23,992 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:23,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:23,992 INFO L82 PathProgramCache]: Analyzing trace with hash -913182030, now seen corresponding path program 1 times [2019-12-07 17:56:23,992 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:23,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867832363] [2019-12-07 17:56:23,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:24,024 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:24,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867832363] [2019-12-07 17:56:24,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:24,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:24,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161717796] [2019-12-07 17:56:24,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:24,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:24,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:24,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:24,025 INFO L87 Difference]: Start difference. First operand 242 states and 379 transitions. Second operand 4 states. [2019-12-07 17:56:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:24,312 INFO L93 Difference]: Finished difference Result 527 states and 824 transitions. [2019-12-07 17:56:24,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:24,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:56:24,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:24,314 INFO L225 Difference]: With dead ends: 527 [2019-12-07 17:56:24,314 INFO L226 Difference]: Without dead ends: 304 [2019-12-07 17:56:24,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:24,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-12-07 17:56:24,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 242. [2019-12-07 17:56:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 17:56:24,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 378 transitions. [2019-12-07 17:56:24,320 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 378 transitions. Word has length 96 [2019-12-07 17:56:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:24,320 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 378 transitions. [2019-12-07 17:56:24,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 378 transitions. [2019-12-07 17:56:24,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:56:24,321 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:24,321 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:24,321 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:24,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:24,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1881615651, now seen corresponding path program 1 times [2019-12-07 17:56:24,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:24,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529162376] [2019-12-07 17:56:24,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:24,366 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:24,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529162376] [2019-12-07 17:56:24,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:24,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:24,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185071841] [2019-12-07 17:56:24,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:24,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:24,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:24,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:24,368 INFO L87 Difference]: Start difference. First operand 242 states and 378 transitions. Second operand 4 states. [2019-12-07 17:56:24,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:24,675 INFO L93 Difference]: Finished difference Result 525 states and 820 transitions. [2019-12-07 17:56:24,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:24,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:56:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:24,677 INFO L225 Difference]: With dead ends: 525 [2019-12-07 17:56:24,677 INFO L226 Difference]: Without dead ends: 302 [2019-12-07 17:56:24,677 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:24,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-07 17:56:24,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 242. [2019-12-07 17:56:24,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 17:56:24,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 377 transitions. [2019-12-07 17:56:24,681 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 377 transitions. Word has length 96 [2019-12-07 17:56:24,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:24,681 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 377 transitions. [2019-12-07 17:56:24,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:24,681 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 377 transitions. [2019-12-07 17:56:24,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:56:24,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:24,682 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:24,682 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:24,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash 121604637, now seen corresponding path program 1 times [2019-12-07 17:56:24,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:24,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993559993] [2019-12-07 17:56:24,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:24,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:24,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993559993] [2019-12-07 17:56:24,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:24,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:24,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029533520] [2019-12-07 17:56:24,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:24,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:24,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:24,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:24,718 INFO L87 Difference]: Start difference. First operand 242 states and 377 transitions. Second operand 4 states. [2019-12-07 17:56:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:25,058 INFO L93 Difference]: Finished difference Result 524 states and 817 transitions. [2019-12-07 17:56:25,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:25,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:56:25,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:25,061 INFO L225 Difference]: With dead ends: 524 [2019-12-07 17:56:25,061 INFO L226 Difference]: Without dead ends: 301 [2019-12-07 17:56:25,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2019-12-07 17:56:25,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 242. [2019-12-07 17:56:25,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-12-07 17:56:25,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 376 transitions. [2019-12-07 17:56:25,069 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 376 transitions. Word has length 96 [2019-12-07 17:56:25,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:25,070 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 376 transitions. [2019-12-07 17:56:25,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 376 transitions. [2019-12-07 17:56:25,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:56:25,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:25,071 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:25,072 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:25,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:25,072 INFO L82 PathProgramCache]: Analyzing trace with hash 973721414, now seen corresponding path program 1 times [2019-12-07 17:56:25,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:25,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514798149] [2019-12-07 17:56:25,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 17:56:25,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514798149] [2019-12-07 17:56:25,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:25,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:56:25,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222907085] [2019-12-07 17:56:25,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:56:25,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:56:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:25,126 INFO L87 Difference]: Start difference. First operand 242 states and 376 transitions. Second operand 5 states. [2019-12-07 17:56:25,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:25,437 INFO L93 Difference]: Finished difference Result 486 states and 760 transitions. [2019-12-07 17:56:25,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:56:25,437 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-07 17:56:25,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:25,438 INFO L225 Difference]: With dead ends: 486 [2019-12-07 17:56:25,438 INFO L226 Difference]: Without dead ends: 263 [2019-12-07 17:56:25,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:56:25,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2019-12-07 17:56:25,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 262. [2019-12-07 17:56:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 402 transitions. [2019-12-07 17:56:25,442 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 402 transitions. Word has length 96 [2019-12-07 17:56:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:25,443 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 402 transitions. [2019-12-07 17:56:25,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:56:25,443 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 402 transitions. [2019-12-07 17:56:25,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:56:25,443 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:25,443 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:25,443 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:25,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:25,444 INFO L82 PathProgramCache]: Analyzing trace with hash -494830241, now seen corresponding path program 1 times [2019-12-07 17:56:25,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:25,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274957283] [2019-12-07 17:56:25,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:25,476 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:25,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274957283] [2019-12-07 17:56:25,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:25,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:25,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220641388] [2019-12-07 17:56:25,477 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:25,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:25,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:25,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:25,477 INFO L87 Difference]: Start difference. First operand 262 states and 402 transitions. Second operand 4 states. [2019-12-07 17:56:25,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:25,685 INFO L93 Difference]: Finished difference Result 528 states and 812 transitions. [2019-12-07 17:56:25,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:25,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:56:25,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:25,687 INFO L225 Difference]: With dead ends: 528 [2019-12-07 17:56:25,687 INFO L226 Difference]: Without dead ends: 285 [2019-12-07 17:56:25,687 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:25,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2019-12-07 17:56:25,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 262. [2019-12-07 17:56:25,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 401 transitions. [2019-12-07 17:56:25,691 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 401 transitions. Word has length 96 [2019-12-07 17:56:25,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:25,692 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 401 transitions. [2019-12-07 17:56:25,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:25,692 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 401 transitions. [2019-12-07 17:56:25,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:56:25,692 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:25,692 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:25,692 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:25,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:25,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1508390047, now seen corresponding path program 1 times [2019-12-07 17:56:25,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:25,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115123862] [2019-12-07 17:56:25,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:25,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115123862] [2019-12-07 17:56:25,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:25,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:25,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694912803] [2019-12-07 17:56:25,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:25,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:25,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:25,726 INFO L87 Difference]: Start difference. First operand 262 states and 401 transitions. Second operand 4 states. [2019-12-07 17:56:25,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:25,959 INFO L93 Difference]: Finished difference Result 527 states and 809 transitions. [2019-12-07 17:56:25,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:25,959 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-07 17:56:25,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:25,961 INFO L225 Difference]: With dead ends: 527 [2019-12-07 17:56:25,961 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 17:56:25,961 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 17:56:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2019-12-07 17:56:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 400 transitions. [2019-12-07 17:56:25,965 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 400 transitions. Word has length 96 [2019-12-07 17:56:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:25,965 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 400 transitions. [2019-12-07 17:56:25,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 400 transitions. [2019-12-07 17:56:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:56:25,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:25,966 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:25,966 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:25,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:25,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1407479420, now seen corresponding path program 1 times [2019-12-07 17:56:25,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:25,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532921065] [2019-12-07 17:56:25,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:25,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:25,998 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:25,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532921065] [2019-12-07 17:56:25,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:25,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:25,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034160802] [2019-12-07 17:56:25,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:25,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:25,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:25,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:25,999 INFO L87 Difference]: Start difference. First operand 262 states and 400 transitions. Second operand 4 states. [2019-12-07 17:56:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:26,296 INFO L93 Difference]: Finished difference Result 564 states and 862 transitions. [2019-12-07 17:56:26,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:26,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 17:56:26,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:26,298 INFO L225 Difference]: With dead ends: 564 [2019-12-07 17:56:26,299 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 17:56:26,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:26,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 17:56:26,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262. [2019-12-07 17:56:26,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 399 transitions. [2019-12-07 17:56:26,304 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 399 transitions. Word has length 97 [2019-12-07 17:56:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:26,304 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 399 transitions. [2019-12-07 17:56:26,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 399 transitions. [2019-12-07 17:56:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 17:56:26,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:26,305 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:26,305 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:26,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:26,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1448154170, now seen corresponding path program 1 times [2019-12-07 17:56:26,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:26,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157091054] [2019-12-07 17:56:26,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:26,347 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:26,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157091054] [2019-12-07 17:56:26,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:26,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:26,347 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756578657] [2019-12-07 17:56:26,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:26,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:26,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:26,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:26,348 INFO L87 Difference]: Start difference. First operand 262 states and 399 transitions. Second operand 4 states. [2019-12-07 17:56:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:26,584 INFO L93 Difference]: Finished difference Result 527 states and 805 transitions. [2019-12-07 17:56:26,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:26,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 17:56:26,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:26,585 INFO L225 Difference]: With dead ends: 527 [2019-12-07 17:56:26,585 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 17:56:26,586 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 17:56:26,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2019-12-07 17:56:26,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:26,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 398 transitions. [2019-12-07 17:56:26,590 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 398 transitions. Word has length 97 [2019-12-07 17:56:26,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:26,590 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 398 transitions. [2019-12-07 17:56:26,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:26,590 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 398 transitions. [2019-12-07 17:56:26,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 17:56:26,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:26,590 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:26,591 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:26,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:26,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1384198823, now seen corresponding path program 1 times [2019-12-07 17:56:26,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:26,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139270783] [2019-12-07 17:56:26,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:26,620 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:26,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139270783] [2019-12-07 17:56:26,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:26,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:26,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580620593] [2019-12-07 17:56:26,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:26,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:26,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:26,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:26,622 INFO L87 Difference]: Start difference. First operand 262 states and 398 transitions. Second operand 4 states. [2019-12-07 17:56:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:26,892 INFO L93 Difference]: Finished difference Result 564 states and 858 transitions. [2019-12-07 17:56:26,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:26,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 17:56:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:26,893 INFO L225 Difference]: With dead ends: 564 [2019-12-07 17:56:26,893 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 17:56:26,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:26,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 17:56:26,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262. [2019-12-07 17:56:26,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:26,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 397 transitions. [2019-12-07 17:56:26,898 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 397 transitions. Word has length 98 [2019-12-07 17:56:26,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:26,898 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 397 transitions. [2019-12-07 17:56:26,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 397 transitions. [2019-12-07 17:56:26,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 17:56:26,899 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:26,899 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:26,899 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:26,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:26,899 INFO L82 PathProgramCache]: Analyzing trace with hash -123281573, now seen corresponding path program 1 times [2019-12-07 17:56:26,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:26,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977868616] [2019-12-07 17:56:26,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:26,929 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:26,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977868616] [2019-12-07 17:56:26,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:26,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:26,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464908202] [2019-12-07 17:56:26,930 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:26,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:26,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:26,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:26,930 INFO L87 Difference]: Start difference. First operand 262 states and 397 transitions. Second operand 4 states. [2019-12-07 17:56:27,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:27,171 INFO L93 Difference]: Finished difference Result 527 states and 801 transitions. [2019-12-07 17:56:27,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:27,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-07 17:56:27,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:27,173 INFO L225 Difference]: With dead ends: 527 [2019-12-07 17:56:27,173 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 17:56:27,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:27,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 17:56:27,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2019-12-07 17:56:27,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:27,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 396 transitions. [2019-12-07 17:56:27,178 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 396 transitions. Word has length 98 [2019-12-07 17:56:27,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:27,179 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 396 transitions. [2019-12-07 17:56:27,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 396 transitions. [2019-12-07 17:56:27,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 17:56:27,179 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:27,180 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:27,180 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:27,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:27,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1473940617, now seen corresponding path program 1 times [2019-12-07 17:56:27,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:27,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188226959] [2019-12-07 17:56:27,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:27,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:27,215 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:27,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188226959] [2019-12-07 17:56:27,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:27,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:27,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885664913] [2019-12-07 17:56:27,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:27,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:27,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:27,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:27,216 INFO L87 Difference]: Start difference. First operand 262 states and 396 transitions. Second operand 4 states. [2019-12-07 17:56:27,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:27,510 INFO L93 Difference]: Finished difference Result 564 states and 854 transitions. [2019-12-07 17:56:27,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:27,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 17:56:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:27,512 INFO L225 Difference]: With dead ends: 564 [2019-12-07 17:56:27,512 INFO L226 Difference]: Without dead ends: 321 [2019-12-07 17:56:27,512 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:27,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2019-12-07 17:56:27,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 262. [2019-12-07 17:56:27,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 395 transitions. [2019-12-07 17:56:27,516 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 395 transitions. Word has length 99 [2019-12-07 17:56:27,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:27,517 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 395 transitions. [2019-12-07 17:56:27,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:27,517 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 395 transitions. [2019-12-07 17:56:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 17:56:27,517 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:27,517 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:27,517 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:27,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1040211531, now seen corresponding path program 1 times [2019-12-07 17:56:27,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:27,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604206246] [2019-12-07 17:56:27,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:27,547 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:27,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604206246] [2019-12-07 17:56:27,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:27,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:27,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196083607] [2019-12-07 17:56:27,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:27,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:27,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:27,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:27,548 INFO L87 Difference]: Start difference. First operand 262 states and 395 transitions. Second operand 4 states. [2019-12-07 17:56:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:27,763 INFO L93 Difference]: Finished difference Result 527 states and 797 transitions. [2019-12-07 17:56:27,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:27,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-12-07 17:56:27,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:27,764 INFO L225 Difference]: With dead ends: 527 [2019-12-07 17:56:27,764 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 17:56:27,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:27,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 17:56:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 262. [2019-12-07 17:56:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 394 transitions. [2019-12-07 17:56:27,769 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 394 transitions. Word has length 99 [2019-12-07 17:56:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:27,769 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 394 transitions. [2019-12-07 17:56:27,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 394 transitions. [2019-12-07 17:56:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 17:56:27,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:27,769 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:27,770 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:27,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash 591968884, now seen corresponding path program 1 times [2019-12-07 17:56:27,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:27,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781370184] [2019-12-07 17:56:27,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:27,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781370184] [2019-12-07 17:56:27,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:27,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:27,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349531125] [2019-12-07 17:56:27,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:27,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:27,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:27,801 INFO L87 Difference]: Start difference. First operand 262 states and 394 transitions. Second operand 4 states. [2019-12-07 17:56:28,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:28,079 INFO L93 Difference]: Finished difference Result 554 states and 838 transitions. [2019-12-07 17:56:28,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:28,079 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 17:56:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:28,080 INFO L225 Difference]: With dead ends: 554 [2019-12-07 17:56:28,080 INFO L226 Difference]: Without dead ends: 311 [2019-12-07 17:56:28,081 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:28,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-12-07 17:56:28,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2019-12-07 17:56:28,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:28,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 393 transitions. [2019-12-07 17:56:28,085 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 393 transitions. Word has length 100 [2019-12-07 17:56:28,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:28,085 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 393 transitions. [2019-12-07 17:56:28,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:28,085 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 393 transitions. [2019-12-07 17:56:28,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 17:56:28,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:28,086 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:28,086 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:28,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1152668662, now seen corresponding path program 1 times [2019-12-07 17:56:28,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:28,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234491310] [2019-12-07 17:56:28,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:28,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:28,116 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:28,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234491310] [2019-12-07 17:56:28,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:28,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:28,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567448727] [2019-12-07 17:56:28,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:28,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:28,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:28,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:28,118 INFO L87 Difference]: Start difference. First operand 262 states and 393 transitions. Second operand 4 states. [2019-12-07 17:56:28,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:28,320 INFO L93 Difference]: Finished difference Result 517 states and 781 transitions. [2019-12-07 17:56:28,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:28,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-12-07 17:56:28,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:28,321 INFO L225 Difference]: With dead ends: 517 [2019-12-07 17:56:28,321 INFO L226 Difference]: Without dead ends: 274 [2019-12-07 17:56:28,322 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:28,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-12-07 17:56:28,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 262. [2019-12-07 17:56:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:28,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 392 transitions. [2019-12-07 17:56:28,327 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 392 transitions. Word has length 100 [2019-12-07 17:56:28,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:28,327 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 392 transitions. [2019-12-07 17:56:28,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:28,327 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 392 transitions. [2019-12-07 17:56:28,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 17:56:28,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:28,328 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:28,328 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:28,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:28,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1802565754, now seen corresponding path program 1 times [2019-12-07 17:56:28,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:28,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322008689] [2019-12-07 17:56:28,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:28,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322008689] [2019-12-07 17:56:28,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:28,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:28,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168524508] [2019-12-07 17:56:28,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:28,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:28,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:28,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:28,382 INFO L87 Difference]: Start difference. First operand 262 states and 392 transitions. Second operand 4 states. [2019-12-07 17:56:28,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:28,647 INFO L93 Difference]: Finished difference Result 554 states and 834 transitions. [2019-12-07 17:56:28,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:28,648 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 17:56:28,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:28,650 INFO L225 Difference]: With dead ends: 554 [2019-12-07 17:56:28,650 INFO L226 Difference]: Without dead ends: 311 [2019-12-07 17:56:28,650 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2019-12-07 17:56:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 262. [2019-12-07 17:56:28,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 17:56:28,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 391 transitions. [2019-12-07 17:56:28,657 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 391 transitions. Word has length 104 [2019-12-07 17:56:28,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:28,657 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 391 transitions. [2019-12-07 17:56:28,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:28,657 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 391 transitions. [2019-12-07 17:56:28,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-12-07 17:56:28,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:28,658 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:28,658 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:28,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:28,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1385169148, now seen corresponding path program 1 times [2019-12-07 17:56:28,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:28,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089666773] [2019-12-07 17:56:28,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:28,702 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:28,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089666773] [2019-12-07 17:56:28,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:28,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:28,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294662235] [2019-12-07 17:56:28,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:28,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:28,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:28,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:28,703 INFO L87 Difference]: Start difference. First operand 262 states and 391 transitions. Second operand 4 states. [2019-12-07 17:56:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:28,943 INFO L93 Difference]: Finished difference Result 558 states and 841 transitions. [2019-12-07 17:56:28,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:28,943 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-12-07 17:56:28,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:28,945 INFO L225 Difference]: With dead ends: 558 [2019-12-07 17:56:28,945 INFO L226 Difference]: Without dead ends: 315 [2019-12-07 17:56:28,945 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-12-07 17:56:28,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-12-07 17:56:28,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 288. [2019-12-07 17:56:28,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 436 transitions. [2019-12-07 17:56:28,949 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 436 transitions. Word has length 104 [2019-12-07 17:56:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:28,949 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 436 transitions. [2019-12-07 17:56:28,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:28,950 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 436 transitions. [2019-12-07 17:56:28,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-12-07 17:56:28,950 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:28,950 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:28,950 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:28,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:28,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1895055843, now seen corresponding path program 1 times [2019-12-07 17:56:28,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:28,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987632265] [2019-12-07 17:56:28,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:28,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987632265] [2019-12-07 17:56:28,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:28,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:28,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233211507] [2019-12-07 17:56:28,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:28,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:28,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:28,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:28,991 INFO L87 Difference]: Start difference. First operand 288 states and 436 transitions. Second operand 4 states. [2019-12-07 17:56:29,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:29,271 INFO L93 Difference]: Finished difference Result 606 states and 922 transitions. [2019-12-07 17:56:29,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:29,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-12-07 17:56:29,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:29,273 INFO L225 Difference]: With dead ends: 606 [2019-12-07 17:56:29,273 INFO L226 Difference]: Without dead ends: 337 [2019-12-07 17:56:29,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2019-12-07 17:56:29,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 288. [2019-12-07 17:56:29,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 435 transitions. [2019-12-07 17:56:29,278 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 435 transitions. Word has length 107 [2019-12-07 17:56:29,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:29,278 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 435 transitions. [2019-12-07 17:56:29,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:29,278 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 435 transitions. [2019-12-07 17:56:29,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-12-07 17:56:29,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:29,279 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:29,279 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:29,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:29,279 INFO L82 PathProgramCache]: Analyzing trace with hash -199039046, now seen corresponding path program 1 times [2019-12-07 17:56:29,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:29,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87948936] [2019-12-07 17:56:29,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:29,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87948936] [2019-12-07 17:56:29,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:29,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:29,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647920096] [2019-12-07 17:56:29,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:29,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:29,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:29,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:29,319 INFO L87 Difference]: Start difference. First operand 288 states and 435 transitions. Second operand 4 states. [2019-12-07 17:56:29,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:29,579 INFO L93 Difference]: Finished difference Result 598 states and 907 transitions. [2019-12-07 17:56:29,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:29,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-12-07 17:56:29,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:29,580 INFO L225 Difference]: With dead ends: 598 [2019-12-07 17:56:29,580 INFO L226 Difference]: Without dead ends: 329 [2019-12-07 17:56:29,581 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:29,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-07 17:56:29,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2019-12-07 17:56:29,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:29,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 434 transitions. [2019-12-07 17:56:29,585 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 434 transitions. Word has length 108 [2019-12-07 17:56:29,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:29,585 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 434 transitions. [2019-12-07 17:56:29,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:29,586 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 434 transitions. [2019-12-07 17:56:29,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-12-07 17:56:29,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:29,586 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:29,586 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:29,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:29,586 INFO L82 PathProgramCache]: Analyzing trace with hash -939388547, now seen corresponding path program 1 times [2019-12-07 17:56:29,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:29,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724291129] [2019-12-07 17:56:29,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:29,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:29,623 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:29,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724291129] [2019-12-07 17:56:29,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:29,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:29,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594446613] [2019-12-07 17:56:29,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:29,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:29,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:29,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:29,624 INFO L87 Difference]: Start difference. First operand 288 states and 434 transitions. Second operand 4 states. [2019-12-07 17:56:29,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:29,872 INFO L93 Difference]: Finished difference Result 598 states and 905 transitions. [2019-12-07 17:56:29,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:29,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-12-07 17:56:29,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:29,874 INFO L225 Difference]: With dead ends: 598 [2019-12-07 17:56:29,874 INFO L226 Difference]: Without dead ends: 329 [2019-12-07 17:56:29,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:29,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-07 17:56:29,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2019-12-07 17:56:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:29,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 433 transitions. [2019-12-07 17:56:29,879 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 433 transitions. Word has length 109 [2019-12-07 17:56:29,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:29,879 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 433 transitions. [2019-12-07 17:56:29,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 433 transitions. [2019-12-07 17:56:29,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 17:56:29,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:29,880 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:29,880 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:29,880 INFO L82 PathProgramCache]: Analyzing trace with hash 255315471, now seen corresponding path program 1 times [2019-12-07 17:56:29,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:29,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638016666] [2019-12-07 17:56:29,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:29,917 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:29,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638016666] [2019-12-07 17:56:29,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:29,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:29,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179494521] [2019-12-07 17:56:29,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:29,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:29,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:29,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:29,918 INFO L87 Difference]: Start difference. First operand 288 states and 433 transitions. Second operand 4 states. [2019-12-07 17:56:30,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:30,178 INFO L93 Difference]: Finished difference Result 598 states and 903 transitions. [2019-12-07 17:56:30,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:30,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 17:56:30,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:30,180 INFO L225 Difference]: With dead ends: 598 [2019-12-07 17:56:30,180 INFO L226 Difference]: Without dead ends: 329 [2019-12-07 17:56:30,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2019-12-07 17:56:30,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 288. [2019-12-07 17:56:30,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 432 transitions. [2019-12-07 17:56:30,185 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 432 transitions. Word has length 110 [2019-12-07 17:56:30,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:30,185 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 432 transitions. [2019-12-07 17:56:30,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:30,185 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 432 transitions. [2019-12-07 17:56:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 17:56:30,186 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:30,186 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:30,186 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:30,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:30,186 INFO L82 PathProgramCache]: Analyzing trace with hash -482968774, now seen corresponding path program 1 times [2019-12-07 17:56:30,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:30,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118055417] [2019-12-07 17:56:30,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:30,233 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:30,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118055417] [2019-12-07 17:56:30,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:30,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:30,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410455304] [2019-12-07 17:56:30,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:30,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:30,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:30,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:30,234 INFO L87 Difference]: Start difference. First operand 288 states and 432 transitions. Second operand 4 states. [2019-12-07 17:56:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:30,474 INFO L93 Difference]: Finished difference Result 596 states and 899 transitions. [2019-12-07 17:56:30,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:30,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-12-07 17:56:30,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:30,476 INFO L225 Difference]: With dead ends: 596 [2019-12-07 17:56:30,476 INFO L226 Difference]: Without dead ends: 327 [2019-12-07 17:56:30,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:30,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-12-07 17:56:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 288. [2019-12-07 17:56:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:30,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 431 transitions. [2019-12-07 17:56:30,481 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 431 transitions. Word has length 110 [2019-12-07 17:56:30,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:30,481 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 431 transitions. [2019-12-07 17:56:30,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 431 transitions. [2019-12-07 17:56:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 17:56:30,481 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:30,482 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:30,482 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:30,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:30,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1831981746, now seen corresponding path program 1 times [2019-12-07 17:56:30,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:30,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534553385] [2019-12-07 17:56:30,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:30,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534553385] [2019-12-07 17:56:30,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:30,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:30,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123924642] [2019-12-07 17:56:30,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:30,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:30,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:30,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:30,518 INFO L87 Difference]: Start difference. First operand 288 states and 431 transitions. Second operand 4 states. [2019-12-07 17:56:30,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:30,752 INFO L93 Difference]: Finished difference Result 594 states and 894 transitions. [2019-12-07 17:56:30,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:30,752 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 17:56:30,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:30,753 INFO L225 Difference]: With dead ends: 594 [2019-12-07 17:56:30,753 INFO L226 Difference]: Without dead ends: 325 [2019-12-07 17:56:30,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:30,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2019-12-07 17:56:30,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 288. [2019-12-07 17:56:30,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:30,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 430 transitions. [2019-12-07 17:56:30,759 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 430 transitions. Word has length 111 [2019-12-07 17:56:30,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:30,759 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 430 transitions. [2019-12-07 17:56:30,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:30,759 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 430 transitions. [2019-12-07 17:56:30,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 17:56:30,760 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:30,760 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:30,760 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:30,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:30,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1978581477, now seen corresponding path program 1 times [2019-12-07 17:56:30,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:30,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599589853] [2019-12-07 17:56:30,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:30,803 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:30,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599589853] [2019-12-07 17:56:30,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:30,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:30,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436547143] [2019-12-07 17:56:30,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:30,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:30,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:30,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:30,804 INFO L87 Difference]: Start difference. First operand 288 states and 430 transitions. Second operand 4 states. [2019-12-07 17:56:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:31,033 INFO L93 Difference]: Finished difference Result 591 states and 888 transitions. [2019-12-07 17:56:31,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:31,034 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 17:56:31,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:31,035 INFO L225 Difference]: With dead ends: 591 [2019-12-07 17:56:31,035 INFO L226 Difference]: Without dead ends: 322 [2019-12-07 17:56:31,035 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:31,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-07 17:56:31,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 288. [2019-12-07 17:56:31,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:31,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 429 transitions. [2019-12-07 17:56:31,042 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 429 transitions. Word has length 111 [2019-12-07 17:56:31,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:31,042 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 429 transitions. [2019-12-07 17:56:31,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:31,042 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 429 transitions. [2019-12-07 17:56:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 17:56:31,043 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:31,043 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:31,043 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:31,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:31,044 INFO L82 PathProgramCache]: Analyzing trace with hash 318860468, now seen corresponding path program 1 times [2019-12-07 17:56:31,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:31,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638625437] [2019-12-07 17:56:31,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:31,087 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:31,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638625437] [2019-12-07 17:56:31,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:31,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:31,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562234783] [2019-12-07 17:56:31,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:31,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:31,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:31,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:31,088 INFO L87 Difference]: Start difference. First operand 288 states and 429 transitions. Second operand 4 states. [2019-12-07 17:56:31,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:31,325 INFO L93 Difference]: Finished difference Result 591 states and 886 transitions. [2019-12-07 17:56:31,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:31,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-12-07 17:56:31,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:31,327 INFO L225 Difference]: With dead ends: 591 [2019-12-07 17:56:31,327 INFO L226 Difference]: Without dead ends: 322 [2019-12-07 17:56:31,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:31,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-12-07 17:56:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 288. [2019-12-07 17:56:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:31,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 428 transitions. [2019-12-07 17:56:31,333 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 428 transitions. Word has length 114 [2019-12-07 17:56:31,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:31,333 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 428 transitions. [2019-12-07 17:56:31,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 428 transitions. [2019-12-07 17:56:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 17:56:31,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:31,334 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:31,334 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:31,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:31,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1161678702, now seen corresponding path program 1 times [2019-12-07 17:56:31,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:31,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582565959] [2019-12-07 17:56:31,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:31,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:31,380 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:31,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582565959] [2019-12-07 17:56:31,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:31,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:31,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726399780] [2019-12-07 17:56:31,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:31,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:31,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:31,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:31,381 INFO L87 Difference]: Start difference. First operand 288 states and 428 transitions. Second operand 4 states. [2019-12-07 17:56:31,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:31,623 INFO L93 Difference]: Finished difference Result 585 states and 875 transitions. [2019-12-07 17:56:31,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:31,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 17:56:31,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:31,624 INFO L225 Difference]: With dead ends: 585 [2019-12-07 17:56:31,625 INFO L226 Difference]: Without dead ends: 316 [2019-12-07 17:56:31,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-07 17:56:31,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 288. [2019-12-07 17:56:31,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 427 transitions. [2019-12-07 17:56:31,630 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 427 transitions. Word has length 115 [2019-12-07 17:56:31,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:31,630 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 427 transitions. [2019-12-07 17:56:31,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:31,630 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 427 transitions. [2019-12-07 17:56:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 17:56:31,630 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:31,631 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:31,631 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:31,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:31,631 INFO L82 PathProgramCache]: Analyzing trace with hash -812555508, now seen corresponding path program 1 times [2019-12-07 17:56:31,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:31,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180487291] [2019-12-07 17:56:31,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:31,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180487291] [2019-12-07 17:56:31,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:31,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:31,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789064022] [2019-12-07 17:56:31,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:31,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:31,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:31,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:31,672 INFO L87 Difference]: Start difference. First operand 288 states and 427 transitions. Second operand 4 states. [2019-12-07 17:56:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:31,892 INFO L93 Difference]: Finished difference Result 585 states and 873 transitions. [2019-12-07 17:56:31,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:31,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-12-07 17:56:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:31,894 INFO L225 Difference]: With dead ends: 585 [2019-12-07 17:56:31,894 INFO L226 Difference]: Without dead ends: 316 [2019-12-07 17:56:31,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:31,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2019-12-07 17:56:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 288. [2019-12-07 17:56:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:31,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 426 transitions. [2019-12-07 17:56:31,899 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 426 transitions. Word has length 115 [2019-12-07 17:56:31,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:31,899 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 426 transitions. [2019-12-07 17:56:31,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:31,899 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 426 transitions. [2019-12-07 17:56:31,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 17:56:31,900 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:31,900 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:31,900 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:31,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:31,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1758352270, now seen corresponding path program 1 times [2019-12-07 17:56:31,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:31,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40859304] [2019-12-07 17:56:31,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:31,946 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:31,946 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40859304] [2019-12-07 17:56:31,946 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:31,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:31,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421243044] [2019-12-07 17:56:31,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:31,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:31,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:31,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:31,947 INFO L87 Difference]: Start difference. First operand 288 states and 426 transitions. Second operand 4 states. [2019-12-07 17:56:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:32,178 INFO L93 Difference]: Finished difference Result 582 states and 867 transitions. [2019-12-07 17:56:32,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:32,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-12-07 17:56:32,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:32,180 INFO L225 Difference]: With dead ends: 582 [2019-12-07 17:56:32,180 INFO L226 Difference]: Without dead ends: 313 [2019-12-07 17:56:32,180 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:32,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-12-07 17:56:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 288. [2019-12-07 17:56:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 425 transitions. [2019-12-07 17:56:32,185 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 425 transitions. Word has length 116 [2019-12-07 17:56:32,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:32,185 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 425 transitions. [2019-12-07 17:56:32,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:32,185 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 425 transitions. [2019-12-07 17:56:32,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 17:56:32,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:32,185 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:32,186 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:32,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:32,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1648474628, now seen corresponding path program 1 times [2019-12-07 17:56:32,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:32,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78763459] [2019-12-07 17:56:32,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:32,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:32,226 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:32,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78763459] [2019-12-07 17:56:32,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:32,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:32,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532298657] [2019-12-07 17:56:32,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:32,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:32,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:32,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:32,227 INFO L87 Difference]: Start difference. First operand 288 states and 425 transitions. Second operand 4 states. [2019-12-07 17:56:32,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:32,453 INFO L93 Difference]: Finished difference Result 582 states and 865 transitions. [2019-12-07 17:56:32,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:32,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 17:56:32,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:32,455 INFO L225 Difference]: With dead ends: 582 [2019-12-07 17:56:32,455 INFO L226 Difference]: Without dead ends: 313 [2019-12-07 17:56:32,455 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-12-07 17:56:32,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 288. [2019-12-07 17:56:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 17:56:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 424 transitions. [2019-12-07 17:56:32,460 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 424 transitions. Word has length 117 [2019-12-07 17:56:32,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:32,460 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 424 transitions. [2019-12-07 17:56:32,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 424 transitions. [2019-12-07 17:56:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 17:56:32,461 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:32,461 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:32,461 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:32,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:32,461 INFO L82 PathProgramCache]: Analyzing trace with hash 576445389, now seen corresponding path program 1 times [2019-12-07 17:56:32,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:32,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296186632] [2019-12-07 17:56:32,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:32,499 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-12-07 17:56:32,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296186632] [2019-12-07 17:56:32,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:32,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:32,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792143719] [2019-12-07 17:56:32,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:32,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:32,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:32,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:32,500 INFO L87 Difference]: Start difference. First operand 288 states and 424 transitions. Second operand 4 states. [2019-12-07 17:56:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:32,762 INFO L93 Difference]: Finished difference Result 629 states and 938 transitions. [2019-12-07 17:56:32,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:32,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-12-07 17:56:32,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:32,765 INFO L225 Difference]: With dead ends: 629 [2019-12-07 17:56:32,765 INFO L226 Difference]: Without dead ends: 360 [2019-12-07 17:56:32,765 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-12-07 17:56:32,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-12-07 17:56:32,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 320. [2019-12-07 17:56:32,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-07 17:56:32,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 481 transitions. [2019-12-07 17:56:32,770 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 481 transitions. Word has length 117 [2019-12-07 17:56:32,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:32,770 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 481 transitions. [2019-12-07 17:56:32,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:32,770 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 481 transitions. [2019-12-07 17:56:32,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 17:56:32,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:32,771 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:32,771 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:32,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:32,771 INFO L82 PathProgramCache]: Analyzing trace with hash -387331418, now seen corresponding path program 1 times [2019-12-07 17:56:32,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:32,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970038280] [2019-12-07 17:56:32,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:32,812 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:32,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970038280] [2019-12-07 17:56:32,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:32,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:32,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849546392] [2019-12-07 17:56:32,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:32,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:32,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:32,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:32,813 INFO L87 Difference]: Start difference. First operand 320 states and 481 transitions. Second operand 4 states. [2019-12-07 17:56:33,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:33,045 INFO L93 Difference]: Finished difference Result 643 states and 973 transitions. [2019-12-07 17:56:33,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:33,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 17:56:33,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:33,047 INFO L225 Difference]: With dead ends: 643 [2019-12-07 17:56:33,047 INFO L226 Difference]: Without dead ends: 342 [2019-12-07 17:56:33,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:33,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2019-12-07 17:56:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 320. [2019-12-07 17:56:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-12-07 17:56:33,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 480 transitions. [2019-12-07 17:56:33,052 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 480 transitions. Word has length 118 [2019-12-07 17:56:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:33,053 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 480 transitions. [2019-12-07 17:56:33,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:33,053 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 480 transitions. [2019-12-07 17:56:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 17:56:33,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:33,053 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:33,053 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:33,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1529071120, now seen corresponding path program 1 times [2019-12-07 17:56:33,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:33,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904993797] [2019-12-07 17:56:33,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:33,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:33,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904993797] [2019-12-07 17:56:33,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:33,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:33,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58183310] [2019-12-07 17:56:33,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:33,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:33,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:33,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:33,092 INFO L87 Difference]: Start difference. First operand 320 states and 480 transitions. Second operand 4 states. [2019-12-07 17:56:33,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:33,408 INFO L93 Difference]: Finished difference Result 731 states and 1110 transitions. [2019-12-07 17:56:33,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:33,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 17:56:33,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:33,411 INFO L225 Difference]: With dead ends: 731 [2019-12-07 17:56:33,411 INFO L226 Difference]: Without dead ends: 430 [2019-12-07 17:56:33,411 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-12-07 17:56:33,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-12-07 17:56:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 359. [2019-12-07 17:56:33,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2019-12-07 17:56:33,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 551 transitions. [2019-12-07 17:56:33,417 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 551 transitions. Word has length 118 [2019-12-07 17:56:33,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:33,417 INFO L462 AbstractCegarLoop]: Abstraction has 359 states and 551 transitions. [2019-12-07 17:56:33,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:33,418 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 551 transitions. [2019-12-07 17:56:33,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 17:56:33,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:33,419 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:33,419 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:33,419 INFO L82 PathProgramCache]: Analyzing trace with hash 956386496, now seen corresponding path program 1 times [2019-12-07 17:56:33,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:33,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072848117] [2019-12-07 17:56:33,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:33,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:33,463 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:33,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072848117] [2019-12-07 17:56:33,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:33,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:33,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898000377] [2019-12-07 17:56:33,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:33,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:33,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:33,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:33,464 INFO L87 Difference]: Start difference. First operand 359 states and 551 transitions. Second operand 4 states. [2019-12-07 17:56:33,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:33,778 INFO L93 Difference]: Finished difference Result 762 states and 1169 transitions. [2019-12-07 17:56:33,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:33,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 17:56:33,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:33,781 INFO L225 Difference]: With dead ends: 762 [2019-12-07 17:56:33,781 INFO L226 Difference]: Without dead ends: 422 [2019-12-07 17:56:33,781 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-12-07 17:56:33,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2019-12-07 17:56:33,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 358. [2019-12-07 17:56:33,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 17:56:33,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 550 transitions. [2019-12-07 17:56:33,787 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 550 transitions. Word has length 119 [2019-12-07 17:56:33,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:33,787 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 550 transitions. [2019-12-07 17:56:33,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:33,787 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 550 transitions. [2019-12-07 17:56:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-12-07 17:56:33,788 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:33,788 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:33,788 INFO L410 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:33,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:33,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1776138505, now seen corresponding path program 1 times [2019-12-07 17:56:33,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:33,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147162317] [2019-12-07 17:56:33,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:33,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:33,825 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:33,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147162317] [2019-12-07 17:56:33,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:33,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:33,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004211153] [2019-12-07 17:56:33,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:33,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:33,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:33,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:33,826 INFO L87 Difference]: Start difference. First operand 358 states and 550 transitions. Second operand 4 states. [2019-12-07 17:56:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:34,068 INFO L93 Difference]: Finished difference Result 724 states and 1113 transitions. [2019-12-07 17:56:34,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:34,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-12-07 17:56:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:34,070 INFO L225 Difference]: With dead ends: 724 [2019-12-07 17:56:34,070 INFO L226 Difference]: Without dead ends: 385 [2019-12-07 17:56:34,070 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-12-07 17:56:34,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-07 17:56:34,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 358. [2019-12-07 17:56:34,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 17:56:34,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 549 transitions. [2019-12-07 17:56:34,076 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 549 transitions. Word has length 119 [2019-12-07 17:56:34,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:34,076 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 549 transitions. [2019-12-07 17:56:34,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:34,076 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 549 transitions. [2019-12-07 17:56:34,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 17:56:34,077 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:34,077 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:34,077 INFO L410 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:34,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:34,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1454298220, now seen corresponding path program 1 times [2019-12-07 17:56:34,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:34,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700603308] [2019-12-07 17:56:34,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:34,112 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:34,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700603308] [2019-12-07 17:56:34,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:34,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:34,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055043323] [2019-12-07 17:56:34,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:34,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:34,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:34,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:34,113 INFO L87 Difference]: Start difference. First operand 358 states and 549 transitions. Second operand 4 states. [2019-12-07 17:56:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:34,336 INFO L93 Difference]: Finished difference Result 724 states and 1111 transitions. [2019-12-07 17:56:34,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:34,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-12-07 17:56:34,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:34,338 INFO L225 Difference]: With dead ends: 724 [2019-12-07 17:56:34,338 INFO L226 Difference]: Without dead ends: 385 [2019-12-07 17:56:34,338 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-12-07 17:56:34,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-07 17:56:34,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 358. [2019-12-07 17:56:34,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 17:56:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 548 transitions. [2019-12-07 17:56:34,344 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 548 transitions. Word has length 120 [2019-12-07 17:56:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:34,344 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 548 transitions. [2019-12-07 17:56:34,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 548 transitions. [2019-12-07 17:56:34,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-12-07 17:56:34,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:34,345 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:34,345 INFO L410 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:34,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:34,345 INFO L82 PathProgramCache]: Analyzing trace with hash 620121796, now seen corresponding path program 1 times [2019-12-07 17:56:34,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:34,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989283476] [2019-12-07 17:56:34,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:34,378 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:34,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989283476] [2019-12-07 17:56:34,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:34,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:34,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719289217] [2019-12-07 17:56:34,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:34,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:34,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:34,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:34,379 INFO L87 Difference]: Start difference. First operand 358 states and 548 transitions. Second operand 4 states. [2019-12-07 17:56:34,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:34,591 INFO L93 Difference]: Finished difference Result 724 states and 1109 transitions. [2019-12-07 17:56:34,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:34,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-12-07 17:56:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:34,593 INFO L225 Difference]: With dead ends: 724 [2019-12-07 17:56:34,593 INFO L226 Difference]: Without dead ends: 385 [2019-12-07 17:56:34,594 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-12-07 17:56:34,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2019-12-07 17:56:34,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 358. [2019-12-07 17:56:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 17:56:34,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 547 transitions. [2019-12-07 17:56:34,600 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 547 transitions. Word has length 121 [2019-12-07 17:56:34,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:34,600 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 547 transitions. [2019-12-07 17:56:34,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 547 transitions. [2019-12-07 17:56:34,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-12-07 17:56:34,600 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:34,601 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:34,601 INFO L410 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:34,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:34,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1083394247, now seen corresponding path program 1 times [2019-12-07 17:56:34,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:34,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604575586] [2019-12-07 17:56:34,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:34,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604575586] [2019-12-07 17:56:34,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:34,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:34,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571895138] [2019-12-07 17:56:34,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:34,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:34,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:34,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:34,636 INFO L87 Difference]: Start difference. First operand 358 states and 547 transitions. Second operand 4 states. [2019-12-07 17:56:34,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:34,845 INFO L93 Difference]: Finished difference Result 714 states and 1095 transitions. [2019-12-07 17:56:34,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:34,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-12-07 17:56:34,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:34,847 INFO L225 Difference]: With dead ends: 714 [2019-12-07 17:56:34,847 INFO L226 Difference]: Without dead ends: 375 [2019-12-07 17:56:34,848 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-12-07 17:56:34,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2019-12-07 17:56:34,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 358. [2019-12-07 17:56:34,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 17:56:34,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 546 transitions. [2019-12-07 17:56:34,853 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 546 transitions. Word has length 122 [2019-12-07 17:56:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:34,854 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 546 transitions. [2019-12-07 17:56:34,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:34,854 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 546 transitions. [2019-12-07 17:56:34,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 17:56:34,854 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:34,854 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:34,855 INFO L410 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:34,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:34,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1911205251, now seen corresponding path program 1 times [2019-12-07 17:56:34,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:34,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452125462] [2019-12-07 17:56:34,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:34,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:34,892 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:34,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452125462] [2019-12-07 17:56:34,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:34,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:56:34,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915949442] [2019-12-07 17:56:34,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:56:34,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:34,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:56:34,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:56:34,893 INFO L87 Difference]: Start difference. First operand 358 states and 546 transitions. Second operand 3 states. [2019-12-07 17:56:34,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:34,941 INFO L93 Difference]: Finished difference Result 1032 states and 1589 transitions. [2019-12-07 17:56:34,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:56:34,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-12-07 17:56:34,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:34,943 INFO L225 Difference]: With dead ends: 1032 [2019-12-07 17:56:34,944 INFO L226 Difference]: Without dead ends: 693 [2019-12-07 17:56:34,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:56:34,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2019-12-07 17:56:34,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 691. [2019-12-07 17:56:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-07 17:56:34,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1049 transitions. [2019-12-07 17:56:34,955 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1049 transitions. Word has length 123 [2019-12-07 17:56:34,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:34,955 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1049 transitions. [2019-12-07 17:56:34,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:56:34,955 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1049 transitions. [2019-12-07 17:56:34,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 17:56:34,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:34,956 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:34,956 INFO L410 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:34,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:34,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1943508964, now seen corresponding path program 1 times [2019-12-07 17:56:34,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:34,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234041567] [2019-12-07 17:56:34,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:35,003 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:35,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234041567] [2019-12-07 17:56:35,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:35,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:35,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519328141] [2019-12-07 17:56:35,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:35,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:35,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:35,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:35,004 INFO L87 Difference]: Start difference. First operand 691 states and 1049 transitions. Second operand 4 states. [2019-12-07 17:56:35,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:35,339 INFO L93 Difference]: Finished difference Result 1579 states and 2406 transitions. [2019-12-07 17:56:35,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:35,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-12-07 17:56:35,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:35,342 INFO L225 Difference]: With dead ends: 1579 [2019-12-07 17:56:35,342 INFO L226 Difference]: Without dead ends: 907 [2019-12-07 17:56:35,343 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-12-07 17:56:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2019-12-07 17:56:35,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 769. [2019-12-07 17:56:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-12-07 17:56:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1191 transitions. [2019-12-07 17:56:35,355 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1191 transitions. Word has length 125 [2019-12-07 17:56:35,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:35,356 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1191 transitions. [2019-12-07 17:56:35,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:35,356 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1191 transitions. [2019-12-07 17:56:35,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 17:56:35,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:35,357 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:35,357 INFO L410 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:35,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:35,357 INFO L82 PathProgramCache]: Analyzing trace with hash 993715220, now seen corresponding path program 1 times [2019-12-07 17:56:35,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:35,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758439294] [2019-12-07 17:56:35,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:35,395 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:35,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758439294] [2019-12-07 17:56:35,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:35,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:35,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590486048] [2019-12-07 17:56:35,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:35,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:35,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:35,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:35,396 INFO L87 Difference]: Start difference. First operand 769 states and 1191 transitions. Second operand 4 states. [2019-12-07 17:56:35,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:35,713 INFO L93 Difference]: Finished difference Result 1645 states and 2531 transitions. [2019-12-07 17:56:35,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:35,713 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-12-07 17:56:35,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:35,717 INFO L225 Difference]: With dead ends: 1645 [2019-12-07 17:56:35,717 INFO L226 Difference]: Without dead ends: 895 [2019-12-07 17:56:35,717 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-12-07 17:56:35,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2019-12-07 17:56:35,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 691. [2019-12-07 17:56:35,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2019-12-07 17:56:35,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1049 transitions. [2019-12-07 17:56:35,733 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1049 transitions. Word has length 126 [2019-12-07 17:56:35,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:35,733 INFO L462 AbstractCegarLoop]: Abstraction has 691 states and 1049 transitions. [2019-12-07 17:56:35,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:35,733 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1049 transitions. [2019-12-07 17:56:35,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-12-07 17:56:35,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:35,734 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-12-07 17:56:35,734 INFO L410 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:35,735 INFO L82 PathProgramCache]: Analyzing trace with hash -54668992, now seen corresponding path program 1 times [2019-12-07 17:56:35,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:35,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185254902] [2019-12-07 17:56:35,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:56:35,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185254902] [2019-12-07 17:56:35,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:35,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:35,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429762796] [2019-12-07 17:56:35,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:35,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:35,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:35,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:35,804 INFO L87 Difference]: Start difference. First operand 691 states and 1049 transitions. Second operand 4 states. [2019-12-07 17:56:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:36,036 INFO L93 Difference]: Finished difference Result 1395 states and 2120 transitions. [2019-12-07 17:56:36,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:36,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2019-12-07 17:56:36,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:36,039 INFO L225 Difference]: With dead ends: 1395 [2019-12-07 17:56:36,039 INFO L226 Difference]: Without dead ends: 723 [2019-12-07 17:56:36,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:36,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2019-12-07 17:56:36,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 697. [2019-12-07 17:56:36,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-12-07 17:56:36,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1055 transitions. [2019-12-07 17:56:36,051 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1055 transitions. Word has length 127 [2019-12-07 17:56:36,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:36,051 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 1055 transitions. [2019-12-07 17:56:36,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:36,052 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1055 transitions. [2019-12-07 17:56:36,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 17:56:36,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:36,053 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:36,053 INFO L410 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:36,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:36,053 INFO L82 PathProgramCache]: Analyzing trace with hash 163103256, now seen corresponding path program 1 times [2019-12-07 17:56:36,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:36,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946529251] [2019-12-07 17:56:36,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:56:36,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946529251] [2019-12-07 17:56:36,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:36,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:36,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856353357] [2019-12-07 17:56:36,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:36,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:36,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:36,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:36,090 INFO L87 Difference]: Start difference. First operand 697 states and 1055 transitions. Second operand 4 states. [2019-12-07 17:56:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:36,302 INFO L93 Difference]: Finished difference Result 1409 states and 2134 transitions. [2019-12-07 17:56:36,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:36,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 17:56:36,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:36,305 INFO L225 Difference]: With dead ends: 1409 [2019-12-07 17:56:36,305 INFO L226 Difference]: Without dead ends: 731 [2019-12-07 17:56:36,305 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-12-07 17:56:36,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2019-12-07 17:56:36,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 697. [2019-12-07 17:56:36,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-12-07 17:56:36,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1053 transitions. [2019-12-07 17:56:36,317 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1053 transitions. Word has length 132 [2019-12-07 17:56:36,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:36,317 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 1053 transitions. [2019-12-07 17:56:36,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:36,318 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1053 transitions. [2019-12-07 17:56:36,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 17:56:36,318 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:36,319 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:36,319 INFO L410 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:36,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:36,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1186017118, now seen corresponding path program 1 times [2019-12-07 17:56:36,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:36,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081012280] [2019-12-07 17:56:36,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:36,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:56:36,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081012280] [2019-12-07 17:56:36,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:36,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:36,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184187759] [2019-12-07 17:56:36,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:36,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:36,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:36,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:36,357 INFO L87 Difference]: Start difference. First operand 697 states and 1053 transitions. Second operand 4 states. [2019-12-07 17:56:36,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:36,624 INFO L93 Difference]: Finished difference Result 1501 states and 2280 transitions. [2019-12-07 17:56:36,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:36,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-12-07 17:56:36,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:36,627 INFO L225 Difference]: With dead ends: 1501 [2019-12-07 17:56:36,628 INFO L226 Difference]: Without dead ends: 823 [2019-12-07 17:56:36,628 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-12-07 17:56:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2019-12-07 17:56:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 753. [2019-12-07 17:56:36,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-07 17:56:36,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1151 transitions. [2019-12-07 17:56:36,640 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1151 transitions. Word has length 132 [2019-12-07 17:56:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:36,641 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1151 transitions. [2019-12-07 17:56:36,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:36,641 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1151 transitions. [2019-12-07 17:56:36,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 17:56:36,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:36,642 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:36,642 INFO L410 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:36,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:36,642 INFO L82 PathProgramCache]: Analyzing trace with hash -474605355, now seen corresponding path program 1 times [2019-12-07 17:56:36,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:36,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751972917] [2019-12-07 17:56:36,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:36,680 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:56:36,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751972917] [2019-12-07 17:56:36,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:36,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:36,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352022000] [2019-12-07 17:56:36,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:36,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:36,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:36,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:36,681 INFO L87 Difference]: Start difference. First operand 753 states and 1151 transitions. Second operand 4 states. [2019-12-07 17:56:36,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:36,891 INFO L93 Difference]: Finished difference Result 1517 states and 2322 transitions. [2019-12-07 17:56:36,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:36,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 17:56:36,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:36,894 INFO L225 Difference]: With dead ends: 1517 [2019-12-07 17:56:36,894 INFO L226 Difference]: Without dead ends: 783 [2019-12-07 17:56:36,895 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-12-07 17:56:36,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-12-07 17:56:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 753. [2019-12-07 17:56:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-07 17:56:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1149 transitions. [2019-12-07 17:56:36,907 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1149 transitions. Word has length 133 [2019-12-07 17:56:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:36,907 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1149 transitions. [2019-12-07 17:56:36,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:36,907 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1149 transitions. [2019-12-07 17:56:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-12-07 17:56:36,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:36,908 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:36,909 INFO L410 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:36,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1650329195, now seen corresponding path program 1 times [2019-12-07 17:56:36,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:36,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42007639] [2019-12-07 17:56:36,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:36,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:36,942 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:36,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42007639] [2019-12-07 17:56:36,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:36,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:36,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391257542] [2019-12-07 17:56:36,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:36,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:36,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:36,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:36,943 INFO L87 Difference]: Start difference. First operand 753 states and 1149 transitions. Second operand 4 states. [2019-12-07 17:56:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:37,245 INFO L93 Difference]: Finished difference Result 1691 states and 2587 transitions. [2019-12-07 17:56:37,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:37,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-12-07 17:56:37,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:37,249 INFO L225 Difference]: With dead ends: 1691 [2019-12-07 17:56:37,249 INFO L226 Difference]: Without dead ends: 957 [2019-12-07 17:56:37,249 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-12-07 17:56:37,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-12-07 17:56:37,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 777. [2019-12-07 17:56:37,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-12-07 17:56:37,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1183 transitions. [2019-12-07 17:56:37,263 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1183 transitions. Word has length 133 [2019-12-07 17:56:37,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:37,263 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1183 transitions. [2019-12-07 17:56:37,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1183 transitions. [2019-12-07 17:56:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 17:56:37,264 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:37,264 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:37,264 INFO L410 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:37,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:37,264 INFO L82 PathProgramCache]: Analyzing trace with hash -1686985376, now seen corresponding path program 1 times [2019-12-07 17:56:37,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:37,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110869714] [2019-12-07 17:56:37,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:37,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:37,306 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:37,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110869714] [2019-12-07 17:56:37,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:37,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:37,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370015718] [2019-12-07 17:56:37,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:37,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:37,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:37,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:37,307 INFO L87 Difference]: Start difference. First operand 777 states and 1183 transitions. Second operand 4 states. [2019-12-07 17:56:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:37,615 INFO L93 Difference]: Finished difference Result 1715 states and 2619 transitions. [2019-12-07 17:56:37,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:37,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 134 [2019-12-07 17:56:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:37,618 INFO L225 Difference]: With dead ends: 1715 [2019-12-07 17:56:37,618 INFO L226 Difference]: Without dead ends: 957 [2019-12-07 17:56:37,619 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-12-07 17:56:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-12-07 17:56:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 779. [2019-12-07 17:56:37,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2019-12-07 17:56:37,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1185 transitions. [2019-12-07 17:56:37,633 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1185 transitions. Word has length 134 [2019-12-07 17:56:37,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:37,633 INFO L462 AbstractCegarLoop]: Abstraction has 779 states and 1185 transitions. [2019-12-07 17:56:37,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:37,633 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1185 transitions. [2019-12-07 17:56:37,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-12-07 17:56:37,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:37,634 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:37,634 INFO L410 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:37,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:37,634 INFO L82 PathProgramCache]: Analyzing trace with hash 2024578128, now seen corresponding path program 1 times [2019-12-07 17:56:37,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:37,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461275631] [2019-12-07 17:56:37,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:37,682 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:37,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461275631] [2019-12-07 17:56:37,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:37,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:37,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602261187] [2019-12-07 17:56:37,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:37,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:37,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:37,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:37,683 INFO L87 Difference]: Start difference. First operand 779 states and 1185 transitions. Second operand 4 states. [2019-12-07 17:56:37,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:37,999 INFO L93 Difference]: Finished difference Result 1717 states and 2619 transitions. [2019-12-07 17:56:37,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:37,999 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-12-07 17:56:38,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:38,005 INFO L225 Difference]: With dead ends: 1717 [2019-12-07 17:56:38,005 INFO L226 Difference]: Without dead ends: 957 [2019-12-07 17:56:38,006 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-12-07 17:56:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-12-07 17:56:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 781. [2019-12-07 17:56:38,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2019-12-07 17:56:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1187 transitions. [2019-12-07 17:56:38,023 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1187 transitions. Word has length 135 [2019-12-07 17:56:38,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:38,024 INFO L462 AbstractCegarLoop]: Abstraction has 781 states and 1187 transitions. [2019-12-07 17:56:38,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:38,024 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1187 transitions. [2019-12-07 17:56:38,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-12-07 17:56:38,025 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:38,025 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:38,025 INFO L410 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:38,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1671867579, now seen corresponding path program 1 times [2019-12-07 17:56:38,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:38,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826002377] [2019-12-07 17:56:38,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:38,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:38,059 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:38,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826002377] [2019-12-07 17:56:38,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:38,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:38,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388467576] [2019-12-07 17:56:38,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:38,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:38,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:38,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:38,059 INFO L87 Difference]: Start difference. First operand 781 states and 1187 transitions. Second operand 4 states. [2019-12-07 17:56:38,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:38,344 INFO L93 Difference]: Finished difference Result 1699 states and 2595 transitions. [2019-12-07 17:56:38,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:38,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-12-07 17:56:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:38,347 INFO L225 Difference]: With dead ends: 1699 [2019-12-07 17:56:38,348 INFO L226 Difference]: Without dead ends: 937 [2019-12-07 17:56:38,348 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-12-07 17:56:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-12-07 17:56:38,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 783. [2019-12-07 17:56:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-07 17:56:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1189 transitions. [2019-12-07 17:56:38,363 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1189 transitions. Word has length 136 [2019-12-07 17:56:38,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:38,363 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1189 transitions. [2019-12-07 17:56:38,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:38,363 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1189 transitions. [2019-12-07 17:56:38,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-12-07 17:56:38,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:38,364 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:38,364 INFO L410 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:38,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:38,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1345966615, now seen corresponding path program 1 times [2019-12-07 17:56:38,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:38,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171489770] [2019-12-07 17:56:38,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:38,398 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:38,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171489770] [2019-12-07 17:56:38,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:38,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:38,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845847766] [2019-12-07 17:56:38,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:38,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:38,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:38,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:38,399 INFO L87 Difference]: Start difference. First operand 783 states and 1189 transitions. Second operand 4 states. [2019-12-07 17:56:38,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:38,715 INFO L93 Difference]: Finished difference Result 1721 states and 2619 transitions. [2019-12-07 17:56:38,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:38,716 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-12-07 17:56:38,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:38,717 INFO L225 Difference]: With dead ends: 1721 [2019-12-07 17:56:38,717 INFO L226 Difference]: Without dead ends: 957 [2019-12-07 17:56:38,718 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-12-07 17:56:38,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-12-07 17:56:38,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 783. [2019-12-07 17:56:38,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-07 17:56:38,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1187 transitions. [2019-12-07 17:56:38,733 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1187 transitions. Word has length 140 [2019-12-07 17:56:38,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:38,733 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1187 transitions. [2019-12-07 17:56:38,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:38,733 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1187 transitions. [2019-12-07 17:56:38,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 17:56:38,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:38,734 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:38,735 INFO L410 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:38,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:38,735 INFO L82 PathProgramCache]: Analyzing trace with hash -841679988, now seen corresponding path program 1 times [2019-12-07 17:56:38,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:38,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506418027] [2019-12-07 17:56:38,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:38,769 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:38,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506418027] [2019-12-07 17:56:38,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:38,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:38,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400228781] [2019-12-07 17:56:38,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:38,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:38,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:38,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:38,770 INFO L87 Difference]: Start difference. First operand 783 states and 1187 transitions. Second operand 4 states. [2019-12-07 17:56:39,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:39,094 INFO L93 Difference]: Finished difference Result 1721 states and 2615 transitions. [2019-12-07 17:56:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:39,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-12-07 17:56:39,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:39,096 INFO L225 Difference]: With dead ends: 1721 [2019-12-07 17:56:39,096 INFO L226 Difference]: Without dead ends: 957 [2019-12-07 17:56:39,096 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-12-07 17:56:39,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-12-07 17:56:39,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 783. [2019-12-07 17:56:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-07 17:56:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1185 transitions. [2019-12-07 17:56:39,111 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1185 transitions. Word has length 141 [2019-12-07 17:56:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:39,111 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1185 transitions. [2019-12-07 17:56:39,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:39,111 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1185 transitions. [2019-12-07 17:56:39,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 17:56:39,112 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:39,112 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:39,112 INFO L410 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:39,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:39,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1835725916, now seen corresponding path program 1 times [2019-12-07 17:56:39,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:39,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948269470] [2019-12-07 17:56:39,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:39,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:39,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948269470] [2019-12-07 17:56:39,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:39,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:39,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011891374] [2019-12-07 17:56:39,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:39,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:39,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:39,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:39,149 INFO L87 Difference]: Start difference. First operand 783 states and 1185 transitions. Second operand 4 states. [2019-12-07 17:56:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:39,466 INFO L93 Difference]: Finished difference Result 1721 states and 2611 transitions. [2019-12-07 17:56:39,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:39,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-12-07 17:56:39,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:39,468 INFO L225 Difference]: With dead ends: 1721 [2019-12-07 17:56:39,468 INFO L226 Difference]: Without dead ends: 957 [2019-12-07 17:56:39,468 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-12-07 17:56:39,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2019-12-07 17:56:39,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 783. [2019-12-07 17:56:39,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2019-12-07 17:56:39,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1183 transitions. [2019-12-07 17:56:39,483 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1183 transitions. Word has length 142 [2019-12-07 17:56:39,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:39,484 INFO L462 AbstractCegarLoop]: Abstraction has 783 states and 1183 transitions. [2019-12-07 17:56:39,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:39,484 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1183 transitions. [2019-12-07 17:56:39,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 17:56:39,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:39,485 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:39,485 INFO L410 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:39,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:39,485 INFO L82 PathProgramCache]: Analyzing trace with hash -2033440793, now seen corresponding path program 1 times [2019-12-07 17:56:39,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:39,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201143101] [2019-12-07 17:56:39,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:39,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201143101] [2019-12-07 17:56:39,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:39,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:39,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111491418] [2019-12-07 17:56:39,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:39,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:39,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:39,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:39,524 INFO L87 Difference]: Start difference. First operand 783 states and 1183 transitions. Second operand 4 states. [2019-12-07 17:56:39,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:39,862 INFO L93 Difference]: Finished difference Result 1701 states and 2583 transitions. [2019-12-07 17:56:39,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:39,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-12-07 17:56:39,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:39,863 INFO L225 Difference]: With dead ends: 1701 [2019-12-07 17:56:39,863 INFO L226 Difference]: Without dead ends: 937 [2019-12-07 17:56:39,864 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-12-07 17:56:39,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-12-07 17:56:39,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 753. [2019-12-07 17:56:39,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2019-12-07 17:56:39,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 1141 transitions. [2019-12-07 17:56:39,879 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 1141 transitions. Word has length 143 [2019-12-07 17:56:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:39,879 INFO L462 AbstractCegarLoop]: Abstraction has 753 states and 1141 transitions. [2019-12-07 17:56:39,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 1141 transitions. [2019-12-07 17:56:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 17:56:39,880 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:39,880 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:39,881 INFO L410 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:39,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:39,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1206713846, now seen corresponding path program 1 times [2019-12-07 17:56:39,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:39,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138007327] [2019-12-07 17:56:39,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:39,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138007327] [2019-12-07 17:56:39,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:39,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:39,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197499813] [2019-12-07 17:56:39,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:39,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:39,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:39,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:39,919 INFO L87 Difference]: Start difference. First operand 753 states and 1141 transitions. Second operand 4 states. [2019-12-07 17:56:40,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:40,226 INFO L93 Difference]: Finished difference Result 1671 states and 2539 transitions. [2019-12-07 17:56:40,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:40,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-12-07 17:56:40,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:40,228 INFO L225 Difference]: With dead ends: 1671 [2019-12-07 17:56:40,228 INFO L226 Difference]: Without dead ends: 937 [2019-12-07 17:56:40,228 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-12-07 17:56:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-12-07 17:56:40,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 809. [2019-12-07 17:56:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-12-07 17:56:40,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1231 transitions. [2019-12-07 17:56:40,249 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1231 transitions. Word has length 143 [2019-12-07 17:56:40,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:40,249 INFO L462 AbstractCegarLoop]: Abstraction has 809 states and 1231 transitions. [2019-12-07 17:56:40,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1231 transitions. [2019-12-07 17:56:40,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-12-07 17:56:40,250 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:40,250 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:40,251 INFO L410 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:40,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1466540801, now seen corresponding path program 1 times [2019-12-07 17:56:40,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:40,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975150660] [2019-12-07 17:56:40,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:40,293 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:40,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975150660] [2019-12-07 17:56:40,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:40,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:40,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397711492] [2019-12-07 17:56:40,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:40,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:40,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:40,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:40,294 INFO L87 Difference]: Start difference. First operand 809 states and 1231 transitions. Second operand 4 states. [2019-12-07 17:56:40,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:40,572 INFO L93 Difference]: Finished difference Result 1711 states and 2601 transitions. [2019-12-07 17:56:40,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:40,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 144 [2019-12-07 17:56:40,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:40,574 INFO L225 Difference]: With dead ends: 1711 [2019-12-07 17:56:40,574 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 17:56:40,574 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-12-07 17:56:40,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 17:56:40,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 811. [2019-12-07 17:56:40,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 17:56:40,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1233 transitions. [2019-12-07 17:56:40,590 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1233 transitions. Word has length 144 [2019-12-07 17:56:40,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:40,591 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1233 transitions. [2019-12-07 17:56:40,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:40,591 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1233 transitions. [2019-12-07 17:56:40,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 17:56:40,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:40,592 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:40,592 INFO L410 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash 203867404, now seen corresponding path program 1 times [2019-12-07 17:56:40,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:40,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630964092] [2019-12-07 17:56:40,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:56:40,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630964092] [2019-12-07 17:56:40,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:40,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:40,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517053084] [2019-12-07 17:56:40,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:40,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:40,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:40,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:40,630 INFO L87 Difference]: Start difference. First operand 811 states and 1233 transitions. Second operand 4 states. [2019-12-07 17:56:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:40,904 INFO L93 Difference]: Finished difference Result 1713 states and 2601 transitions. [2019-12-07 17:56:40,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:40,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 146 [2019-12-07 17:56:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:40,906 INFO L225 Difference]: With dead ends: 1713 [2019-12-07 17:56:40,906 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 17:56:40,906 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-12-07 17:56:40,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 17:56:40,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 811. [2019-12-07 17:56:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 17:56:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1231 transitions. [2019-12-07 17:56:40,923 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1231 transitions. Word has length 146 [2019-12-07 17:56:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:40,923 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1231 transitions. [2019-12-07 17:56:40,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1231 transitions. [2019-12-07 17:56:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 17:56:40,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:40,924 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:40,924 INFO L410 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:40,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:40,924 INFO L82 PathProgramCache]: Analyzing trace with hash 789083233, now seen corresponding path program 1 times [2019-12-07 17:56:40,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:40,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978445142] [2019-12-07 17:56:40,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:40,962 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:56:40,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978445142] [2019-12-07 17:56:40,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:40,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:40,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160226656] [2019-12-07 17:56:40,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:40,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:40,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:40,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:40,963 INFO L87 Difference]: Start difference. First operand 811 states and 1231 transitions. Second operand 4 states. [2019-12-07 17:56:41,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:41,243 INFO L93 Difference]: Finished difference Result 1709 states and 2593 transitions. [2019-12-07 17:56:41,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:41,243 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 17:56:41,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:41,244 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 17:56:41,244 INFO L226 Difference]: Without dead ends: 917 [2019-12-07 17:56:41,245 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-12-07 17:56:41,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-12-07 17:56:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 811. [2019-12-07 17:56:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-12-07 17:56:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1229 transitions. [2019-12-07 17:56:41,261 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1229 transitions. Word has length 147 [2019-12-07 17:56:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:41,261 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1229 transitions. [2019-12-07 17:56:41,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1229 transitions. [2019-12-07 17:56:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 17:56:41,262 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:41,262 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:41,263 INFO L410 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:41,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:41,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1848437108, now seen corresponding path program 1 times [2019-12-07 17:56:41,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:41,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203449989] [2019-12-07 17:56:41,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:41,302 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:41,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203449989] [2019-12-07 17:56:41,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:41,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:41,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19849745] [2019-12-07 17:56:41,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:41,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:41,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:41,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:41,303 INFO L87 Difference]: Start difference. First operand 811 states and 1229 transitions. Second operand 4 states. [2019-12-07 17:56:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:41,556 INFO L93 Difference]: Finished difference Result 1703 states and 2581 transitions. [2019-12-07 17:56:41,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:41,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 17:56:41,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:41,558 INFO L225 Difference]: With dead ends: 1703 [2019-12-07 17:56:41,558 INFO L226 Difference]: Without dead ends: 911 [2019-12-07 17:56:41,559 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-12-07 17:56:41,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2019-12-07 17:56:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 817. [2019-12-07 17:56:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 17:56:41,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1239 transitions. [2019-12-07 17:56:41,585 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1239 transitions. Word has length 147 [2019-12-07 17:56:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:41,586 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1239 transitions. [2019-12-07 17:56:41,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1239 transitions. [2019-12-07 17:56:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-12-07 17:56:41,587 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:41,587 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:41,588 INFO L410 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:41,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:41,588 INFO L82 PathProgramCache]: Analyzing trace with hash 643623075, now seen corresponding path program 1 times [2019-12-07 17:56:41,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:41,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310264213] [2019-12-07 17:56:41,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:41,654 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:56:41,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310264213] [2019-12-07 17:56:41,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:41,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:41,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932457132] [2019-12-07 17:56:41,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:41,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:41,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:41,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:41,655 INFO L87 Difference]: Start difference. First operand 817 states and 1239 transitions. Second operand 4 states. [2019-12-07 17:56:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:41,945 INFO L93 Difference]: Finished difference Result 1685 states and 2552 transitions. [2019-12-07 17:56:41,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:41,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2019-12-07 17:56:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:41,947 INFO L225 Difference]: With dead ends: 1685 [2019-12-07 17:56:41,947 INFO L226 Difference]: Without dead ends: 887 [2019-12-07 17:56:41,947 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-12-07 17:56:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-12-07 17:56:41,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2019-12-07 17:56:41,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 17:56:41,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1237 transitions. [2019-12-07 17:56:41,963 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1237 transitions. Word has length 147 [2019-12-07 17:56:41,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:41,963 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1237 transitions. [2019-12-07 17:56:41,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:41,963 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1237 transitions. [2019-12-07 17:56:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 17:56:41,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:41,964 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:41,965 INFO L410 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:41,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:41,965 INFO L82 PathProgramCache]: Analyzing trace with hash 706058258, now seen corresponding path program 1 times [2019-12-07 17:56:41,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:41,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145907581] [2019-12-07 17:56:41,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:41,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:42,002 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:56:42,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145907581] [2019-12-07 17:56:42,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:42,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:42,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104021739] [2019-12-07 17:56:42,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:42,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:42,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:42,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:42,003 INFO L87 Difference]: Start difference. First operand 817 states and 1237 transitions. Second operand 4 states. [2019-12-07 17:56:42,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:42,292 INFO L93 Difference]: Finished difference Result 1685 states and 2548 transitions. [2019-12-07 17:56:42,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:42,293 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-12-07 17:56:42,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:42,293 INFO L225 Difference]: With dead ends: 1685 [2019-12-07 17:56:42,293 INFO L226 Difference]: Without dead ends: 887 [2019-12-07 17:56:42,294 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-12-07 17:56:42,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-12-07 17:56:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2019-12-07 17:56:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 17:56:42,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1235 transitions. [2019-12-07 17:56:42,310 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1235 transitions. Word has length 148 [2019-12-07 17:56:42,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:42,311 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1235 transitions. [2019-12-07 17:56:42,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:42,311 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1235 transitions. [2019-12-07 17:56:42,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 17:56:42,312 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:42,312 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:42,312 INFO L410 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:42,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:42,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1100480546, now seen corresponding path program 1 times [2019-12-07 17:56:42,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:42,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808122494] [2019-12-07 17:56:42,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:42,349 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:56:42,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808122494] [2019-12-07 17:56:42,350 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:42,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:42,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457353976] [2019-12-07 17:56:42,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:42,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:42,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:42,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:42,350 INFO L87 Difference]: Start difference. First operand 817 states and 1235 transitions. Second operand 4 states. [2019-12-07 17:56:42,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:42,629 INFO L93 Difference]: Finished difference Result 1685 states and 2544 transitions. [2019-12-07 17:56:42,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:42,629 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 149 [2019-12-07 17:56:42,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:42,630 INFO L225 Difference]: With dead ends: 1685 [2019-12-07 17:56:42,631 INFO L226 Difference]: Without dead ends: 887 [2019-12-07 17:56:42,631 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-12-07 17:56:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-12-07 17:56:42,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 817. [2019-12-07 17:56:42,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 17:56:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1233 transitions. [2019-12-07 17:56:42,656 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1233 transitions. Word has length 149 [2019-12-07 17:56:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:42,657 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1233 transitions. [2019-12-07 17:56:42,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1233 transitions. [2019-12-07 17:56:42,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 17:56:42,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:42,658 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:42,659 INFO L410 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:42,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:42,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1282070858, now seen corresponding path program 1 times [2019-12-07 17:56:42,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:42,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442052972] [2019-12-07 17:56:42,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:42,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:42,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442052972] [2019-12-07 17:56:42,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:42,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:42,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968704307] [2019-12-07 17:56:42,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:42,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:42,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:42,700 INFO L87 Difference]: Start difference. First operand 817 states and 1233 transitions. Second operand 4 states. [2019-12-07 17:56:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:42,990 INFO L93 Difference]: Finished difference Result 1735 states and 2615 transitions. [2019-12-07 17:56:42,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:42,991 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 17:56:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:42,991 INFO L225 Difference]: With dead ends: 1735 [2019-12-07 17:56:42,992 INFO L226 Difference]: Without dead ends: 937 [2019-12-07 17:56:42,992 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-12-07 17:56:42,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-12-07 17:56:43,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 817. [2019-12-07 17:56:43,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 817 states. [2019-12-07 17:56:43,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 817 states to 817 states and 1231 transitions. [2019-12-07 17:56:43,012 INFO L78 Accepts]: Start accepts. Automaton has 817 states and 1231 transitions. Word has length 150 [2019-12-07 17:56:43,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:43,012 INFO L462 AbstractCegarLoop]: Abstraction has 817 states and 1231 transitions. [2019-12-07 17:56:43,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 817 states and 1231 transitions. [2019-12-07 17:56:43,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 17:56:43,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:43,014 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:43,014 INFO L410 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:43,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:43,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1370800377, now seen corresponding path program 1 times [2019-12-07 17:56:43,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:43,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560265128] [2019-12-07 17:56:43,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:43,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560265128] [2019-12-07 17:56:43,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:43,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:43,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592527840] [2019-12-07 17:56:43,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:43,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:43,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:43,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:43,061 INFO L87 Difference]: Start difference. First operand 817 states and 1231 transitions. Second operand 4 states. [2019-12-07 17:56:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:43,336 INFO L93 Difference]: Finished difference Result 1709 states and 2573 transitions. [2019-12-07 17:56:43,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:43,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 17:56:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:43,337 INFO L225 Difference]: With dead ends: 1709 [2019-12-07 17:56:43,337 INFO L226 Difference]: Without dead ends: 911 [2019-12-07 17:56:43,338 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-12-07 17:56:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2019-12-07 17:56:43,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 819. [2019-12-07 17:56:43,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-07 17:56:43,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1233 transitions. [2019-12-07 17:56:43,356 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1233 transitions. Word has length 150 [2019-12-07 17:56:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:43,356 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1233 transitions. [2019-12-07 17:56:43,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:43,356 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1233 transitions. [2019-12-07 17:56:43,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-12-07 17:56:43,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:43,357 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:43,358 INFO L410 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:43,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:43,358 INFO L82 PathProgramCache]: Analyzing trace with hash -715670803, now seen corresponding path program 1 times [2019-12-07 17:56:43,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:43,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995613200] [2019-12-07 17:56:43,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-12-07 17:56:43,395 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995613200] [2019-12-07 17:56:43,395 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:43,395 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:43,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779662827] [2019-12-07 17:56:43,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:43,396 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:43,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:43,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:43,396 INFO L87 Difference]: Start difference. First operand 819 states and 1233 transitions. Second operand 4 states. [2019-12-07 17:56:43,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:43,654 INFO L93 Difference]: Finished difference Result 1669 states and 2516 transitions. [2019-12-07 17:56:43,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:43,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2019-12-07 17:56:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:43,655 INFO L225 Difference]: With dead ends: 1669 [2019-12-07 17:56:43,655 INFO L226 Difference]: Without dead ends: 869 [2019-12-07 17:56:43,655 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-12-07 17:56:43,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2019-12-07 17:56:43,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 819. [2019-12-07 17:56:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-07 17:56:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1231 transitions. [2019-12-07 17:56:43,678 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1231 transitions. Word has length 150 [2019-12-07 17:56:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:43,678 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1231 transitions. [2019-12-07 17:56:43,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1231 transitions. [2019-12-07 17:56:43,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 17:56:43,680 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:43,680 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:43,681 INFO L410 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:43,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:43,681 INFO L82 PathProgramCache]: Analyzing trace with hash -492359123, now seen corresponding path program 1 times [2019-12-07 17:56:43,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:43,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420042628] [2019-12-07 17:56:43,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:43,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420042628] [2019-12-07 17:56:43,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:43,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:43,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552252908] [2019-12-07 17:56:43,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:43,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:43,740 INFO L87 Difference]: Start difference. First operand 819 states and 1231 transitions. Second operand 4 states. [2019-12-07 17:56:44,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:44,040 INFO L93 Difference]: Finished difference Result 1721 states and 2581 transitions. [2019-12-07 17:56:44,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:44,040 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 17:56:44,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:44,041 INFO L225 Difference]: With dead ends: 1721 [2019-12-07 17:56:44,041 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 17:56:44,042 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-12-07 17:56:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 17:56:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 819. [2019-12-07 17:56:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2019-12-07 17:56:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1229 transitions. [2019-12-07 17:56:44,060 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1229 transitions. Word has length 151 [2019-12-07 17:56:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:44,060 INFO L462 AbstractCegarLoop]: Abstraction has 819 states and 1229 transitions. [2019-12-07 17:56:44,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1229 transitions. [2019-12-07 17:56:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 17:56:44,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:44,062 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:44,062 INFO L410 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:44,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:44,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1765740119, now seen corresponding path program 1 times [2019-12-07 17:56:44,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:44,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259472457] [2019-12-07 17:56:44,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:44,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:44,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259472457] [2019-12-07 17:56:44,102 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:44,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:44,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365420635] [2019-12-07 17:56:44,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:44,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:44,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:44,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:44,103 INFO L87 Difference]: Start difference. First operand 819 states and 1229 transitions. Second operand 4 states. [2019-12-07 17:56:44,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:44,355 INFO L93 Difference]: Finished difference Result 1699 states and 2549 transitions. [2019-12-07 17:56:44,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:44,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 17:56:44,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:44,356 INFO L225 Difference]: With dead ends: 1699 [2019-12-07 17:56:44,356 INFO L226 Difference]: Without dead ends: 899 [2019-12-07 17:56:44,357 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-12-07 17:56:44,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-12-07 17:56:44,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 821. [2019-12-07 17:56:44,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-12-07 17:56:44,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1231 transitions. [2019-12-07 17:56:44,374 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1231 transitions. Word has length 151 [2019-12-07 17:56:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:44,375 INFO L462 AbstractCegarLoop]: Abstraction has 821 states and 1231 transitions. [2019-12-07 17:56:44,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1231 transitions. [2019-12-07 17:56:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-12-07 17:56:44,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:44,376 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:44,376 INFO L410 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:44,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:44,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1241116697, now seen corresponding path program 1 times [2019-12-07 17:56:44,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:44,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317440729] [2019-12-07 17:56:44,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:44,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317440729] [2019-12-07 17:56:44,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:44,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:44,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373526509] [2019-12-07 17:56:44,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:44,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:44,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:44,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:44,417 INFO L87 Difference]: Start difference. First operand 821 states and 1231 transitions. Second operand 4 states. [2019-12-07 17:56:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:44,683 INFO L93 Difference]: Finished difference Result 1701 states and 2549 transitions. [2019-12-07 17:56:44,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:44,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-12-07 17:56:44,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:44,684 INFO L225 Difference]: With dead ends: 1701 [2019-12-07 17:56:44,684 INFO L226 Difference]: Without dead ends: 899 [2019-12-07 17:56:44,684 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-12-07 17:56:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-12-07 17:56:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 823. [2019-12-07 17:56:44,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-07 17:56:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1233 transitions. [2019-12-07 17:56:44,702 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1233 transitions. Word has length 151 [2019-12-07 17:56:44,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:44,702 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1233 transitions. [2019-12-07 17:56:44,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1233 transitions. [2019-12-07 17:56:44,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-12-07 17:56:44,704 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:44,704 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:44,704 INFO L410 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:44,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:44,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1533357527, now seen corresponding path program 1 times [2019-12-07 17:56:44,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:44,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304790881] [2019-12-07 17:56:44,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:44,745 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:44,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304790881] [2019-12-07 17:56:44,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:44,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:44,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875470583] [2019-12-07 17:56:44,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:44,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:44,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:44,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:44,746 INFO L87 Difference]: Start difference. First operand 823 states and 1233 transitions. Second operand 4 states. [2019-12-07 17:56:45,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:45,002 INFO L93 Difference]: Finished difference Result 1697 states and 2542 transitions. [2019-12-07 17:56:45,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:45,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-12-07 17:56:45,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:45,003 INFO L225 Difference]: With dead ends: 1697 [2019-12-07 17:56:45,003 INFO L226 Difference]: Without dead ends: 893 [2019-12-07 17:56:45,003 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-12-07 17:56:45,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-07 17:56:45,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 825. [2019-12-07 17:56:45,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-12-07 17:56:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1235 transitions. [2019-12-07 17:56:45,022 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1235 transitions. Word has length 152 [2019-12-07 17:56:45,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:45,022 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1235 transitions. [2019-12-07 17:56:45,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:45,022 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1235 transitions. [2019-12-07 17:56:45,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 17:56:45,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:45,023 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:45,023 INFO L410 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:45,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:45,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1103283912, now seen corresponding path program 1 times [2019-12-07 17:56:45,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:45,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794575655] [2019-12-07 17:56:45,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:45,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:45,064 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:56:45,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794575655] [2019-12-07 17:56:45,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:45,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:45,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498411323] [2019-12-07 17:56:45,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:45,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:45,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:45,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:45,065 INFO L87 Difference]: Start difference. First operand 825 states and 1235 transitions. Second operand 4 states. [2019-12-07 17:56:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:45,364 INFO L93 Difference]: Finished difference Result 1727 states and 2577 transitions. [2019-12-07 17:56:45,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:45,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 17:56:45,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:45,365 INFO L225 Difference]: With dead ends: 1727 [2019-12-07 17:56:45,365 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 17:56:45,366 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-12-07 17:56:45,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 17:56:45,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 825. [2019-12-07 17:56:45,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2019-12-07 17:56:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 1233 transitions. [2019-12-07 17:56:45,385 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 1233 transitions. Word has length 153 [2019-12-07 17:56:45,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:45,385 INFO L462 AbstractCegarLoop]: Abstraction has 825 states and 1233 transitions. [2019-12-07 17:56:45,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:45,385 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1233 transitions. [2019-12-07 17:56:45,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 17:56:45,386 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:45,386 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:45,386 INFO L410 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:45,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:45,387 INFO L82 PathProgramCache]: Analyzing trace with hash -855894881, now seen corresponding path program 1 times [2019-12-07 17:56:45,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:45,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582421530] [2019-12-07 17:56:45,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:45,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:45,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582421530] [2019-12-07 17:56:45,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:45,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:45,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247300516] [2019-12-07 17:56:45,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:45,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:45,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:45,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:45,429 INFO L87 Difference]: Start difference. First operand 825 states and 1233 transitions. Second operand 4 states. [2019-12-07 17:56:45,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:45,706 INFO L93 Difference]: Finished difference Result 1699 states and 2538 transitions. [2019-12-07 17:56:45,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:45,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-12-07 17:56:45,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:45,707 INFO L225 Difference]: With dead ends: 1699 [2019-12-07 17:56:45,707 INFO L226 Difference]: Without dead ends: 893 [2019-12-07 17:56:45,708 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-12-07 17:56:45,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2019-12-07 17:56:45,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 827. [2019-12-07 17:56:45,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-07 17:56:45,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1235 transitions. [2019-12-07 17:56:45,731 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1235 transitions. Word has length 153 [2019-12-07 17:56:45,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:45,731 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1235 transitions. [2019-12-07 17:56:45,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:45,731 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1235 transitions. [2019-12-07 17:56:45,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 17:56:45,732 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:45,732 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:45,732 INFO L410 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:45,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:45,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1077901899, now seen corresponding path program 1 times [2019-12-07 17:56:45,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:45,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027489017] [2019-12-07 17:56:45,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:45,771 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:56:45,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027489017] [2019-12-07 17:56:45,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:45,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:45,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249234776] [2019-12-07 17:56:45,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:45,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:45,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:45,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:45,772 INFO L87 Difference]: Start difference. First operand 827 states and 1235 transitions. Second operand 4 states. [2019-12-07 17:56:46,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:46,306 INFO L93 Difference]: Finished difference Result 1725 states and 2569 transitions. [2019-12-07 17:56:46,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:46,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 17:56:46,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:46,308 INFO L225 Difference]: With dead ends: 1725 [2019-12-07 17:56:46,309 INFO L226 Difference]: Without dead ends: 917 [2019-12-07 17:56:46,310 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-12-07 17:56:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2019-12-07 17:56:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 827. [2019-12-07 17:56:46,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-07 17:56:46,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1233 transitions. [2019-12-07 17:56:46,338 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1233 transitions. Word has length 154 [2019-12-07 17:56:46,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:46,338 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1233 transitions. [2019-12-07 17:56:46,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1233 transitions. [2019-12-07 17:56:46,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 17:56:46,339 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:46,339 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:46,339 INFO L410 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:46,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:46,340 INFO L82 PathProgramCache]: Analyzing trace with hash -18548024, now seen corresponding path program 1 times [2019-12-07 17:56:46,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:46,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061454478] [2019-12-07 17:56:46,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:46,381 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:46,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061454478] [2019-12-07 17:56:46,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:46,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:46,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727941176] [2019-12-07 17:56:46,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:46,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:46,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:46,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:46,382 INFO L87 Difference]: Start difference. First operand 827 states and 1233 transitions. Second operand 4 states. [2019-12-07 17:56:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:46,643 INFO L93 Difference]: Finished difference Result 1719 states and 2557 transitions. [2019-12-07 17:56:46,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:46,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 17:56:46,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:46,644 INFO L225 Difference]: With dead ends: 1719 [2019-12-07 17:56:46,644 INFO L226 Difference]: Without dead ends: 911 [2019-12-07 17:56:46,645 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-12-07 17:56:46,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2019-12-07 17:56:46,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 827. [2019-12-07 17:56:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 827 states. [2019-12-07 17:56:46,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1231 transitions. [2019-12-07 17:56:46,674 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1231 transitions. Word has length 154 [2019-12-07 17:56:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:46,675 INFO L462 AbstractCegarLoop]: Abstraction has 827 states and 1231 transitions. [2019-12-07 17:56:46,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1231 transitions. [2019-12-07 17:56:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 17:56:46,676 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:46,676 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:46,676 INFO L410 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:46,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:46,676 INFO L82 PathProgramCache]: Analyzing trace with hash -537874641, now seen corresponding path program 1 times [2019-12-07 17:56:46,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:46,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596209803] [2019-12-07 17:56:46,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:46,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 228 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:46,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596209803] [2019-12-07 17:56:46,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:46,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:46,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319150614] [2019-12-07 17:56:46,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:46,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:46,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:46,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:46,726 INFO L87 Difference]: Start difference. First operand 827 states and 1231 transitions. Second operand 4 states. [2019-12-07 17:56:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:46,986 INFO L93 Difference]: Finished difference Result 1695 states and 2523 transitions. [2019-12-07 17:56:46,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:46,986 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-12-07 17:56:46,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:46,987 INFO L225 Difference]: With dead ends: 1695 [2019-12-07 17:56:46,987 INFO L226 Difference]: Without dead ends: 887 [2019-12-07 17:56:46,987 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-12-07 17:56:46,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2019-12-07 17:56:47,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 829. [2019-12-07 17:56:47,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-12-07 17:56:47,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1233 transitions. [2019-12-07 17:56:47,007 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1233 transitions. Word has length 154 [2019-12-07 17:56:47,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:47,007 INFO L462 AbstractCegarLoop]: Abstraction has 829 states and 1233 transitions. [2019-12-07 17:56:47,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:47,007 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1233 transitions. [2019-12-07 17:56:47,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 17:56:47,008 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:47,008 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:47,009 INFO L410 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:47,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:47,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1843216165, now seen corresponding path program 1 times [2019-12-07 17:56:47,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:47,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682534665] [2019-12-07 17:56:47,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:47,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:47,050 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:47,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682534665] [2019-12-07 17:56:47,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:47,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:47,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789240529] [2019-12-07 17:56:47,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:47,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:47,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:47,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:47,050 INFO L87 Difference]: Start difference. First operand 829 states and 1233 transitions. Second operand 4 states. [2019-12-07 17:56:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:47,327 INFO L93 Difference]: Finished difference Result 1721 states and 2553 transitions. [2019-12-07 17:56:47,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:47,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 17:56:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:47,328 INFO L225 Difference]: With dead ends: 1721 [2019-12-07 17:56:47,328 INFO L226 Difference]: Without dead ends: 911 [2019-12-07 17:56:47,329 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-12-07 17:56:47,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2019-12-07 17:56:47,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 829. [2019-12-07 17:56:47,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-12-07 17:56:47,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1231 transitions. [2019-12-07 17:56:47,349 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1231 transitions. Word has length 157 [2019-12-07 17:56:47,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:47,349 INFO L462 AbstractCegarLoop]: Abstraction has 829 states and 1231 transitions. [2019-12-07 17:56:47,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1231 transitions. [2019-12-07 17:56:47,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-12-07 17:56:47,350 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:47,351 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:47,351 INFO L410 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:47,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:47,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1468724100, now seen corresponding path program 1 times [2019-12-07 17:56:47,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:47,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886815651] [2019-12-07 17:56:47,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:47,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:47,394 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:56:47,394 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886815651] [2019-12-07 17:56:47,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:47,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:47,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912358516] [2019-12-07 17:56:47,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:47,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:47,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:47,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:47,395 INFO L87 Difference]: Start difference. First operand 829 states and 1231 transitions. Second operand 4 states. [2019-12-07 17:56:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:47,688 INFO L93 Difference]: Finished difference Result 1773 states and 2648 transitions. [2019-12-07 17:56:47,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:47,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-12-07 17:56:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:47,689 INFO L225 Difference]: With dead ends: 1773 [2019-12-07 17:56:47,689 INFO L226 Difference]: Without dead ends: 963 [2019-12-07 17:56:47,689 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-12-07 17:56:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2019-12-07 17:56:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 889. [2019-12-07 17:56:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-07 17:56:47,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1337 transitions. [2019-12-07 17:56:47,724 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1337 transitions. Word has length 157 [2019-12-07 17:56:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:47,725 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1337 transitions. [2019-12-07 17:56:47,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1337 transitions. [2019-12-07 17:56:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 17:56:47,726 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:47,727 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:47,727 INFO L410 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash -5752579, now seen corresponding path program 1 times [2019-12-07 17:56:47,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:47,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59822191] [2019-12-07 17:56:47,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:47,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:47,774 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:47,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59822191] [2019-12-07 17:56:47,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:47,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:47,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068777072] [2019-12-07 17:56:47,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:47,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:47,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:47,775 INFO L87 Difference]: Start difference. First operand 889 states and 1337 transitions. Second operand 4 states. [2019-12-07 17:56:48,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:48,095 INFO L93 Difference]: Finished difference Result 1829 states and 2745 transitions. [2019-12-07 17:56:48,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:48,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 17:56:48,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:48,097 INFO L225 Difference]: With dead ends: 1829 [2019-12-07 17:56:48,097 INFO L226 Difference]: Without dead ends: 959 [2019-12-07 17:56:48,098 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-12-07 17:56:48,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-12-07 17:56:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 889. [2019-12-07 17:56:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-07 17:56:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1335 transitions. [2019-12-07 17:56:48,126 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1335 transitions. Word has length 158 [2019-12-07 17:56:48,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:48,126 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1335 transitions. [2019-12-07 17:56:48,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:48,126 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1335 transitions. [2019-12-07 17:56:48,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-12-07 17:56:48,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:48,127 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:48,127 INFO L410 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:48,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:48,127 INFO L82 PathProgramCache]: Analyzing trace with hash 518870843, now seen corresponding path program 1 times [2019-12-07 17:56:48,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:48,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295852545] [2019-12-07 17:56:48,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:48,169 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 150 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:48,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295852545] [2019-12-07 17:56:48,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:48,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:48,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742963973] [2019-12-07 17:56:48,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:48,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:48,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:48,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:48,170 INFO L87 Difference]: Start difference. First operand 889 states and 1335 transitions. Second operand 4 states. [2019-12-07 17:56:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:48,767 INFO L93 Difference]: Finished difference Result 1829 states and 2741 transitions. [2019-12-07 17:56:48,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:48,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-12-07 17:56:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:48,770 INFO L225 Difference]: With dead ends: 1829 [2019-12-07 17:56:48,770 INFO L226 Difference]: Without dead ends: 959 [2019-12-07 17:56:48,772 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-12-07 17:56:48,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2019-12-07 17:56:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 889. [2019-12-07 17:56:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-07 17:56:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1333 transitions. [2019-12-07 17:56:48,806 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1333 transitions. Word has length 158 [2019-12-07 17:56:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:48,807 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1333 transitions. [2019-12-07 17:56:48,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1333 transitions. [2019-12-07 17:56:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 17:56:48,808 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:48,808 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:48,808 INFO L410 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:48,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:48,808 INFO L82 PathProgramCache]: Analyzing trace with hash 258396419, now seen corresponding path program 1 times [2019-12-07 17:56:48,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:48,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540740526] [2019-12-07 17:56:48,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:48,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:48,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540740526] [2019-12-07 17:56:48,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:48,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:48,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622372874] [2019-12-07 17:56:48,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:48,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:48,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:48,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:48,852 INFO L87 Difference]: Start difference. First operand 889 states and 1333 transitions. Second operand 4 states. [2019-12-07 17:56:49,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:49,130 INFO L93 Difference]: Finished difference Result 1823 states and 2730 transitions. [2019-12-07 17:56:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:49,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 17:56:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:49,131 INFO L225 Difference]: With dead ends: 1823 [2019-12-07 17:56:49,131 INFO L226 Difference]: Without dead ends: 953 [2019-12-07 17:56:49,132 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-12-07 17:56:49,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-12-07 17:56:49,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 889. [2019-12-07 17:56:49,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-07 17:56:49,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1331 transitions. [2019-12-07 17:56:49,153 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1331 transitions. Word has length 159 [2019-12-07 17:56:49,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:49,153 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1331 transitions. [2019-12-07 17:56:49,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:49,154 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1331 transitions. [2019-12-07 17:56:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 17:56:49,155 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:49,155 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:49,155 INFO L410 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:49,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:49,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1724983565, now seen corresponding path program 1 times [2019-12-07 17:56:49,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:49,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056535290] [2019-12-07 17:56:49,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:49,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:49,198 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:49,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056535290] [2019-12-07 17:56:49,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:49,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:49,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51975088] [2019-12-07 17:56:49,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:49,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:49,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:49,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:49,199 INFO L87 Difference]: Start difference. First operand 889 states and 1331 transitions. Second operand 4 states. [2019-12-07 17:56:49,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:49,479 INFO L93 Difference]: Finished difference Result 1823 states and 2726 transitions. [2019-12-07 17:56:49,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:49,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 17:56:49,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:49,481 INFO L225 Difference]: With dead ends: 1823 [2019-12-07 17:56:49,481 INFO L226 Difference]: Without dead ends: 953 [2019-12-07 17:56:49,481 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-12-07 17:56:49,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2019-12-07 17:56:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 889. [2019-12-07 17:56:49,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-07 17:56:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1329 transitions. [2019-12-07 17:56:49,503 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1329 transitions. Word has length 160 [2019-12-07 17:56:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:49,504 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1329 transitions. [2019-12-07 17:56:49,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:49,504 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1329 transitions. [2019-12-07 17:56:49,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 17:56:49,505 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:49,505 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:49,505 INFO L410 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:49,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:49,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1981268911, now seen corresponding path program 1 times [2019-12-07 17:56:49,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:49,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214501138] [2019-12-07 17:56:49,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:56:49,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214501138] [2019-12-07 17:56:49,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:49,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:49,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626265582] [2019-12-07 17:56:49,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:49,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:49,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:49,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:49,548 INFO L87 Difference]: Start difference. First operand 889 states and 1329 transitions. Second operand 4 states. [2019-12-07 17:56:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:49,813 INFO L93 Difference]: Finished difference Result 1817 states and 2715 transitions. [2019-12-07 17:56:49,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:49,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 17:56:49,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:49,814 INFO L225 Difference]: With dead ends: 1817 [2019-12-07 17:56:49,814 INFO L226 Difference]: Without dead ends: 947 [2019-12-07 17:56:49,815 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-12-07 17:56:49,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-12-07 17:56:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 889. [2019-12-07 17:56:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-07 17:56:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1327 transitions. [2019-12-07 17:56:49,839 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1327 transitions. Word has length 160 [2019-12-07 17:56:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:49,840 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1327 transitions. [2019-12-07 17:56:49,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1327 transitions. [2019-12-07 17:56:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 17:56:49,840 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:49,841 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:49,841 INFO L410 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:49,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:49,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1795767486, now seen corresponding path program 1 times [2019-12-07 17:56:49,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:49,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668587421] [2019-12-07 17:56:49,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:49,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:49,880 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 17:56:49,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668587421] [2019-12-07 17:56:49,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:49,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:49,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573559945] [2019-12-07 17:56:49,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:49,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:49,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:49,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:49,881 INFO L87 Difference]: Start difference. First operand 889 states and 1327 transitions. Second operand 4 states. [2019-12-07 17:56:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:50,138 INFO L93 Difference]: Finished difference Result 1809 states and 2704 transitions. [2019-12-07 17:56:50,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:50,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-12-07 17:56:50,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:50,139 INFO L225 Difference]: With dead ends: 1809 [2019-12-07 17:56:50,139 INFO L226 Difference]: Without dead ends: 939 [2019-12-07 17:56:50,140 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-12-07 17:56:50,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 939 states. [2019-12-07 17:56:50,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 939 to 889. [2019-12-07 17:56:50,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 889 states. [2019-12-07 17:56:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1325 transitions. [2019-12-07 17:56:50,162 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1325 transitions. Word has length 160 [2019-12-07 17:56:50,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:50,162 INFO L462 AbstractCegarLoop]: Abstraction has 889 states and 1325 transitions. [2019-12-07 17:56:50,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1325 transitions. [2019-12-07 17:56:50,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 17:56:50,163 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:50,163 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:50,163 INFO L410 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:50,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:50,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1709820069, now seen corresponding path program 1 times [2019-12-07 17:56:50,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:50,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507345839] [2019-12-07 17:56:50,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:50,216 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:50,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507345839] [2019-12-07 17:56:50,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:50,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:50,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041482348] [2019-12-07 17:56:50,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:50,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:50,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:50,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:50,217 INFO L87 Difference]: Start difference. First operand 889 states and 1325 transitions. Second operand 4 states. [2019-12-07 17:56:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:50,522 INFO L93 Difference]: Finished difference Result 1817 states and 2707 transitions. [2019-12-07 17:56:50,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:50,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 17:56:50,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:50,523 INFO L225 Difference]: With dead ends: 1817 [2019-12-07 17:56:50,523 INFO L226 Difference]: Without dead ends: 947 [2019-12-07 17:56:50,524 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-12-07 17:56:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2019-12-07 17:56:50,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 873. [2019-12-07 17:56:50,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 873 states. [2019-12-07 17:56:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1305 transitions. [2019-12-07 17:56:50,548 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1305 transitions. Word has length 161 [2019-12-07 17:56:50,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:50,548 INFO L462 AbstractCegarLoop]: Abstraction has 873 states and 1305 transitions. [2019-12-07 17:56:50,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1305 transitions. [2019-12-07 17:56:50,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 17:56:50,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:50,549 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:50,549 INFO L410 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:50,549 INFO L82 PathProgramCache]: Analyzing trace with hash -1012656476, now seen corresponding path program 1 times [2019-12-07 17:56:50,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:50,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218027280] [2019-12-07 17:56:50,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:50,591 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-12-07 17:56:50,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218027280] [2019-12-07 17:56:50,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:50,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:50,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104103686] [2019-12-07 17:56:50,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:50,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:50,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:50,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:50,592 INFO L87 Difference]: Start difference. First operand 873 states and 1305 transitions. Second operand 4 states. [2019-12-07 17:56:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:50,906 INFO L93 Difference]: Finished difference Result 1797 states and 2681 transitions. [2019-12-07 17:56:50,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:50,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 17:56:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:50,908 INFO L225 Difference]: With dead ends: 1797 [2019-12-07 17:56:50,908 INFO L226 Difference]: Without dead ends: 943 [2019-12-07 17:56:50,908 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-12-07 17:56:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-12-07 17:56:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 875. [2019-12-07 17:56:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-12-07 17:56:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1307 transitions. [2019-12-07 17:56:50,934 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1307 transitions. Word has length 161 [2019-12-07 17:56:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:50,934 INFO L462 AbstractCegarLoop]: Abstraction has 875 states and 1307 transitions. [2019-12-07 17:56:50,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1307 transitions. [2019-12-07 17:56:50,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-12-07 17:56:50,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:50,935 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:50,935 INFO L410 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1401621777, now seen corresponding path program 1 times [2019-12-07 17:56:50,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:50,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284064920] [2019-12-07 17:56:50,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-12-07 17:56:50,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284064920] [2019-12-07 17:56:50,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:50,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:50,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666946402] [2019-12-07 17:56:50,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:50,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:50,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:50,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:50,976 INFO L87 Difference]: Start difference. First operand 875 states and 1307 transitions. Second operand 4 states. [2019-12-07 17:56:51,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:51,224 INFO L93 Difference]: Finished difference Result 1777 states and 2660 transitions. [2019-12-07 17:56:51,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:51,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-12-07 17:56:51,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:51,225 INFO L225 Difference]: With dead ends: 1777 [2019-12-07 17:56:51,225 INFO L226 Difference]: Without dead ends: 921 [2019-12-07 17:56:51,226 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-12-07 17:56:51,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2019-12-07 17:56:51,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 875. [2019-12-07 17:56:51,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2019-12-07 17:56:51,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1305 transitions. [2019-12-07 17:56:51,248 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1305 transitions. Word has length 161 [2019-12-07 17:56:51,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:51,249 INFO L462 AbstractCegarLoop]: Abstraction has 875 states and 1305 transitions. [2019-12-07 17:56:51,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:51,249 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1305 transitions. [2019-12-07 17:56:51,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 17:56:51,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:51,250 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:51,250 INFO L410 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:51,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:51,250 INFO L82 PathProgramCache]: Analyzing trace with hash -852383079, now seen corresponding path program 1 times [2019-12-07 17:56:51,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:51,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571754803] [2019-12-07 17:56:51,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:51,299 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:51,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571754803] [2019-12-07 17:56:51,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:51,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:51,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050316992] [2019-12-07 17:56:51,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:51,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:51,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:51,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:51,300 INFO L87 Difference]: Start difference. First operand 875 states and 1305 transitions. Second operand 4 states. [2019-12-07 17:56:51,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:51,560 INFO L93 Difference]: Finished difference Result 1799 states and 2677 transitions. [2019-12-07 17:56:51,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:51,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 163 [2019-12-07 17:56:51,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:51,561 INFO L225 Difference]: With dead ends: 1799 [2019-12-07 17:56:51,561 INFO L226 Difference]: Without dead ends: 943 [2019-12-07 17:56:51,561 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-12-07 17:56:51,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2019-12-07 17:56:51,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 899. [2019-12-07 17:56:51,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2019-12-07 17:56:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1333 transitions. [2019-12-07 17:56:51,585 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1333 transitions. Word has length 163 [2019-12-07 17:56:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:51,585 INFO L462 AbstractCegarLoop]: Abstraction has 899 states and 1333 transitions. [2019-12-07 17:56:51,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1333 transitions. [2019-12-07 17:56:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 17:56:51,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:51,586 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:51,586 INFO L410 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:51,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:51,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1695721119, now seen corresponding path program 1 times [2019-12-07 17:56:51,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:51,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913334145] [2019-12-07 17:56:51,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:56:51,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913334145] [2019-12-07 17:56:51,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:51,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:56:51,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806913838] [2019-12-07 17:56:51,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:56:51,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:51,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:56:51,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:56:51,670 INFO L87 Difference]: Start difference. First operand 899 states and 1333 transitions. Second operand 5 states. [2019-12-07 17:56:52,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:52,249 INFO L93 Difference]: Finished difference Result 1937 states and 2888 transitions. [2019-12-07 17:56:52,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:56:52,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-12-07 17:56:52,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:52,250 INFO L225 Difference]: With dead ends: 1937 [2019-12-07 17:56:52,250 INFO L226 Difference]: Without dead ends: 1057 [2019-12-07 17:56:52,251 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-12-07 17:56:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2019-12-07 17:56:52,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 965. [2019-12-07 17:56:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-12-07 17:56:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1451 transitions. [2019-12-07 17:56:52,278 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1451 transitions. Word has length 163 [2019-12-07 17:56:52,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:52,278 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1451 transitions. [2019-12-07 17:56:52,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:56:52,278 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1451 transitions. [2019-12-07 17:56:52,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 17:56:52,279 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:52,279 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:52,279 INFO L410 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:52,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:52,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1822233353, now seen corresponding path program 1 times [2019-12-07 17:56:52,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:52,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313434944] [2019-12-07 17:56:52,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:52,340 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:56:52,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313434944] [2019-12-07 17:56:52,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:52,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:52,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507720178] [2019-12-07 17:56:52,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:52,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:52,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:52,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:52,341 INFO L87 Difference]: Start difference. First operand 965 states and 1451 transitions. Second operand 4 states. [2019-12-07 17:56:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:52,631 INFO L93 Difference]: Finished difference Result 1945 states and 2926 transitions. [2019-12-07 17:56:52,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:52,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-12-07 17:56:52,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:52,632 INFO L225 Difference]: With dead ends: 1945 [2019-12-07 17:56:52,632 INFO L226 Difference]: Without dead ends: 995 [2019-12-07 17:56:52,632 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-12-07 17:56:52,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2019-12-07 17:56:52,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 963. [2019-12-07 17:56:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 17:56:52,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1447 transitions. [2019-12-07 17:56:52,657 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1447 transitions. Word has length 164 [2019-12-07 17:56:52,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:52,657 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1447 transitions. [2019-12-07 17:56:52,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:52,657 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1447 transitions. [2019-12-07 17:56:52,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 17:56:52,658 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:52,658 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:52,658 INFO L410 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:52,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:52,658 INFO L82 PathProgramCache]: Analyzing trace with hash -1484162341, now seen corresponding path program 1 times [2019-12-07 17:56:52,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:52,658 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141508636] [2019-12-07 17:56:52,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:56:52,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141508636] [2019-12-07 17:56:52,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:52,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:52,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130339291] [2019-12-07 17:56:52,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:52,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:52,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:52,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:52,709 INFO L87 Difference]: Start difference. First operand 963 states and 1447 transitions. Second operand 4 states. [2019-12-07 17:56:52,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:52,970 INFO L93 Difference]: Finished difference Result 1961 states and 2947 transitions. [2019-12-07 17:56:52,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:52,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-12-07 17:56:52,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:52,972 INFO L225 Difference]: With dead ends: 1961 [2019-12-07 17:56:52,972 INFO L226 Difference]: Without dead ends: 1017 [2019-12-07 17:56:52,972 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-12-07 17:56:52,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2019-12-07 17:56:52,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 963. [2019-12-07 17:56:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 17:56:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1445 transitions. [2019-12-07 17:56:52,998 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1445 transitions. Word has length 167 [2019-12-07 17:56:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:52,998 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1445 transitions. [2019-12-07 17:56:52,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:52,998 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1445 transitions. [2019-12-07 17:56:52,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 17:56:52,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:52,999 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:52,999 INFO L410 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:52,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:52,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1066842888, now seen corresponding path program 1 times [2019-12-07 17:56:52,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:52,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047014536] [2019-12-07 17:56:52,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:53,050 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-12-07 17:56:53,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047014536] [2019-12-07 17:56:53,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:56:53,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:56:53,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407075564] [2019-12-07 17:56:53,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:56:53,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:56:53,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:56:53,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:56:53,052 INFO L87 Difference]: Start difference. First operand 963 states and 1445 transitions. Second operand 4 states. [2019-12-07 17:56:53,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:56:53,574 INFO L93 Difference]: Finished difference Result 1957 states and 2939 transitions. [2019-12-07 17:56:53,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:56:53,575 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 168 [2019-12-07 17:56:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:56:53,577 INFO L225 Difference]: With dead ends: 1957 [2019-12-07 17:56:53,577 INFO L226 Difference]: Without dead ends: 1013 [2019-12-07 17:56:53,578 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-12-07 17:56:53,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2019-12-07 17:56:53,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 963. [2019-12-07 17:56:53,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 963 states. [2019-12-07 17:56:53,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1443 transitions. [2019-12-07 17:56:53,619 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1443 transitions. Word has length 168 [2019-12-07 17:56:53,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:56:53,619 INFO L462 AbstractCegarLoop]: Abstraction has 963 states and 1443 transitions. [2019-12-07 17:56:53,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:56:53,619 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1443 transitions. [2019-12-07 17:56:53,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 17:56:53,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:56:53,620 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:56:53,620 INFO L410 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:56:53,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:56:53,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1385917459, now seen corresponding path program 1 times [2019-12-07 17:56:53,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:56:53,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510936026] [2019-12-07 17:56:53,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:56:53,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:53,804 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:56:53,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510936026] [2019-12-07 17:56:53,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891613159] [2019-12-07 17:56:53,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:56:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:56:53,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 603 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 17:56:53,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:56:53,986 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:53,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 17:56:53,987 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,018 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,020 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_162|], 2=[|v_#memory_$Pointer$.base_159|, |v_#memory_$Pointer$.base_158|]} [2019-12-07 17:56:54,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,029 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,030 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,049 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 17:56:54,049 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,071 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:56:54,079 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,092 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,116 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:56:54,116 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:56:54,117 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,126 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,126 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 17:56:54,157 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:56:54,158 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:56:54,158 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,164 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,164 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,164 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:56:54,194 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:56:54,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:56:54,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,200 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,200 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,200 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:56:54,203 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_160|], 12=[|v_#memory_$Pointer$.base_165|]} [2019-12-07 17:56:54,207 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:56:54,217 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,250 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:56:54,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:56:54,251 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,260 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,260 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,260 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:56:54,285 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:56:54,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:56:54,286 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,291 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,291 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,292 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:56:54,312 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:56:54,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:56:54,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,318 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,319 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:56:54,319 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:56:54,326 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_158|], 20=[|v_#memory_$Pointer$.base_168|]} [2019-12-07 17:56:54,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:54,330 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 17:56:54,330 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:56:54,338 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:54,452 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 66 [2019-12-07 17:56:54,452 INFO L343 Elim1Store]: treesize reduction 70, result has 72.8 percent of original size [2019-12-07 17:56:54,452 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 90 treesize of output 218 [2019-12-07 17:56:54,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,818 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:54,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:54,826 INFO L534 ElimStorePlain]: Start of recursive call 3: 24 dim-0 vars, End of recursive call: 24 dim-0 vars, and 3 xjuncts. [2019-12-07 17:56:55,984 WARN L192 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 481 DAG size of output: 288 [2019-12-07 17:56:55,985 INFO L614 ElimStorePlain]: treesize reduction 3372, result has 33.0 percent of original size [2019-12-07 17:56:55,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:55,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 17:56:55,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:55,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:55,994 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 44 dim-0 vars, and 3 xjuncts. [2019-12-07 17:56:55,994 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:2111 [2019-12-07 17:56:57,730 WARN L192 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 347 DAG size of output: 35 [2019-12-07 17:56:57,735 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_161|], 30=[|v_#memory_$Pointer$.base_169|]} [2019-12-07 17:56:57,737 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:56:57,760 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:57,900 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 61 [2019-12-07 17:56:57,901 INFO L343 Elim1Store]: treesize reduction 478, result has 19.7 percent of original size [2019-12-07 17:56:57,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 16 case distinctions, treesize of input 104 treesize of output 142 [2019-12-07 17:56:57,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:57,902 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:57,930 INFO L614 ElimStorePlain]: treesize reduction 69, result has 56.3 percent of original size [2019-12-07 17:56:57,931 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:56:57,931 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:118, output treesize:80 [2019-12-07 17:56:57,955 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_178|], 30=[|v_#memory_$Pointer$.base_170|]} [2019-12-07 17:56:57,959 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:56:57,960 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:57,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:57,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:57,976 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:57,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:57,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:57,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:57,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:58,086 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-12-07 17:56:58,086 INFO L343 Elim1Store]: treesize reduction 56, result has 73.5 percent of original size [2019-12-07 17:56:58,086 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 99 treesize of output 207 [2019-12-07 17:56:58,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:56:58,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,093 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:58,232 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 40 [2019-12-07 17:56:58,232 INFO L614 ElimStorePlain]: treesize reduction 7769, result has 1.1 percent of original size [2019-12-07 17:56:58,233 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:56:58,233 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:112, output treesize:89 [2019-12-07 17:56:58,254 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_159|], 2=[|v_#memory_int_179|], 20=[|v_#memory_$Pointer$.base_171|]} [2019-12-07 17:56:58,257 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2019-12-07 17:56:58,257 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:56:58,271 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:58,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2019-12-07 17:56:58,273 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:56:58,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:58,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:58,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:58,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:56:58,319 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:56:58,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 7 case distinctions, treesize of input 95 treesize of output 147 [2019-12-07 17:56:58,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,324 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:56:58,379 INFO L534 ElimStorePlain]: Start of recursive call 4: 125 dim-0 vars, End of recursive call: 125 dim-0 vars, and 16 xjuncts. [2019-12-07 17:57:00,916 WARN L192 SmtUtils]: Spent 2.54 s on a formula simplification that was a NOOP. DAG size: 1002 [2019-12-07 17:57:00,917 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:00,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:57:00,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 17:57:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:57:00,920 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:57:00,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:57:00,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:57:00,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 11 terms [2019-12-07 17:57:00,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 17:57:00,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:57:00,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 17:57:00,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:57:00,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:57:00,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 17:57:00,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:57:00,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:57:00,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 7 terms [2019-12-07 17:57:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-07 17:57:00,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:57:00,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:00,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:57:00,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:57:00,955 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 250 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:00,956 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:120, output treesize:1761 [2019-12-07 17:57:01,804 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 1263 DAG size of output: 22 [2019-12-07 17:57:01,817 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:57:01,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2019-12-07 17:57:01,818 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:01,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:01,824 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:01,824 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:32 [2019-12-07 17:57:01,858 INFO L343 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2019-12-07 17:57:01,858 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 13 [2019-12-07 17:57:01,858 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:01,862 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:01,862 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:01,862 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-12-07 17:57:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 64 proven. 96 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 17:57:02,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:02,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2019-12-07 17:57:02,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288281873] [2019-12-07 17:57:02,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:57:02,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:02,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:57:02,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:57:02,067 INFO L87 Difference]: Start difference. First operand 963 states and 1443 transitions. Second operand 13 states. [2019-12-07 17:57:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:04,731 INFO L93 Difference]: Finished difference Result 3613 states and 5390 transitions. [2019-12-07 17:57:04,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:57:04,732 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 170 [2019-12-07 17:57:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:04,739 INFO L225 Difference]: With dead ends: 3613 [2019-12-07 17:57:04,740 INFO L226 Difference]: Without dead ends: 2669 [2019-12-07 17:57:04,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:57:04,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2669 states. [2019-12-07 17:57:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2669 to 1795. [2019-12-07 17:57:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-12-07 17:57:04,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2691 transitions. [2019-12-07 17:57:04,823 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2691 transitions. Word has length 170 [2019-12-07 17:57:04,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:04,823 INFO L462 AbstractCegarLoop]: Abstraction has 1795 states and 2691 transitions. [2019-12-07 17:57:04,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:57:04,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2691 transitions. [2019-12-07 17:57:04,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 17:57:04,825 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:04,825 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:05,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:05,026 INFO L410 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:05,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:05,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1256088961, now seen corresponding path program 1 times [2019-12-07 17:57:05,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:05,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98671988] [2019-12-07 17:57:05,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:05,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:05,087 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:57:05,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98671988] [2019-12-07 17:57:05,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:05,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:05,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128537779] [2019-12-07 17:57:05,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:05,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:05,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:05,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:05,088 INFO L87 Difference]: Start difference. First operand 1795 states and 2691 transitions. Second operand 4 states. [2019-12-07 17:57:05,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:05,444 INFO L93 Difference]: Finished difference Result 2867 states and 4288 transitions. [2019-12-07 17:57:05,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:05,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 172 [2019-12-07 17:57:05,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:05,448 INFO L225 Difference]: With dead ends: 2867 [2019-12-07 17:57:05,448 INFO L226 Difference]: Without dead ends: 1923 [2019-12-07 17:57:05,448 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-12-07 17:57:05,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-12-07 17:57:05,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1795. [2019-12-07 17:57:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-12-07 17:57:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2687 transitions. [2019-12-07 17:57:05,523 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2687 transitions. Word has length 172 [2019-12-07 17:57:05,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:05,523 INFO L462 AbstractCegarLoop]: Abstraction has 1795 states and 2687 transitions. [2019-12-07 17:57:05,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2687 transitions. [2019-12-07 17:57:05,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 17:57:05,525 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:05,525 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:05,525 INFO L410 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:05,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:05,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1782335756, now seen corresponding path program 1 times [2019-12-07 17:57:05,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:05,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589876184] [2019-12-07 17:57:05,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:05,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:05,569 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:57:05,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589876184] [2019-12-07 17:57:05,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:05,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:05,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011704613] [2019-12-07 17:57:05,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:05,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:05,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:05,570 INFO L87 Difference]: Start difference. First operand 1795 states and 2687 transitions. Second operand 4 states. [2019-12-07 17:57:05,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:05,932 INFO L93 Difference]: Finished difference Result 2867 states and 4282 transitions. [2019-12-07 17:57:05,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:05,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-12-07 17:57:05,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:05,935 INFO L225 Difference]: With dead ends: 2867 [2019-12-07 17:57:05,935 INFO L226 Difference]: Without dead ends: 1923 [2019-12-07 17:57:05,936 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-12-07 17:57:05,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-12-07 17:57:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1795. [2019-12-07 17:57:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-12-07 17:57:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2683 transitions. [2019-12-07 17:57:05,995 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2683 transitions. Word has length 173 [2019-12-07 17:57:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:05,995 INFO L462 AbstractCegarLoop]: Abstraction has 1795 states and 2683 transitions. [2019-12-07 17:57:05,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2683 transitions. [2019-12-07 17:57:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-12-07 17:57:05,996 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:05,997 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:05,997 INFO L410 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:05,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:05,997 INFO L82 PathProgramCache]: Analyzing trace with hash -931283652, now seen corresponding path program 1 times [2019-12-07 17:57:05,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:05,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393506804] [2019-12-07 17:57:05,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:06,044 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:57:06,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393506804] [2019-12-07 17:57:06,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:06,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:06,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058765008] [2019-12-07 17:57:06,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:06,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:06,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:06,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:06,045 INFO L87 Difference]: Start difference. First operand 1795 states and 2683 transitions. Second operand 4 states. [2019-12-07 17:57:06,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:06,384 INFO L93 Difference]: Finished difference Result 2867 states and 4276 transitions. [2019-12-07 17:57:06,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:06,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-12-07 17:57:06,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:06,387 INFO L225 Difference]: With dead ends: 2867 [2019-12-07 17:57:06,387 INFO L226 Difference]: Without dead ends: 1923 [2019-12-07 17:57:06,387 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-12-07 17:57:06,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1923 states. [2019-12-07 17:57:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1923 to 1795. [2019-12-07 17:57:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-12-07 17:57:06,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2679 transitions. [2019-12-07 17:57:06,445 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2679 transitions. Word has length 174 [2019-12-07 17:57:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:06,446 INFO L462 AbstractCegarLoop]: Abstraction has 1795 states and 2679 transitions. [2019-12-07 17:57:06,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2679 transitions. [2019-12-07 17:57:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 17:57:06,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:06,447 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:06,447 INFO L410 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash 234465615, now seen corresponding path program 1 times [2019-12-07 17:57:06,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:06,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982478340] [2019-12-07 17:57:06,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:57:06,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982478340] [2019-12-07 17:57:06,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:06,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:57:06,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705258258] [2019-12-07 17:57:06,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:06,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:06,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:06,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:06,501 INFO L87 Difference]: Start difference. First operand 1795 states and 2679 transitions. Second operand 4 states. [2019-12-07 17:57:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:06,847 INFO L93 Difference]: Finished difference Result 2847 states and 4246 transitions. [2019-12-07 17:57:06,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:06,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 175 [2019-12-07 17:57:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:06,850 INFO L225 Difference]: With dead ends: 2847 [2019-12-07 17:57:06,850 INFO L226 Difference]: Without dead ends: 1903 [2019-12-07 17:57:06,850 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-12-07 17:57:06,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2019-12-07 17:57:06,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1795. [2019-12-07 17:57:06,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2019-12-07 17:57:06,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 2675 transitions. [2019-12-07 17:57:06,907 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 2675 transitions. Word has length 175 [2019-12-07 17:57:06,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:06,907 INFO L462 AbstractCegarLoop]: Abstraction has 1795 states and 2675 transitions. [2019-12-07 17:57:06,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:06,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 2675 transitions. [2019-12-07 17:57:06,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-12-07 17:57:06,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:06,909 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:06,909 INFO L410 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:06,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:06,909 INFO L82 PathProgramCache]: Analyzing trace with hash -558765564, now seen corresponding path program 1 times [2019-12-07 17:57:06,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:06,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248787501] [2019-12-07 17:57:06,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:06,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 17:57:06,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248787501] [2019-12-07 17:57:06,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:06,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:57:06,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980088826] [2019-12-07 17:57:06,991 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:06,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:06,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:06,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:06,992 INFO L87 Difference]: Start difference. First operand 1795 states and 2675 transitions. Second operand 5 states. [2019-12-07 17:57:07,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:07,419 INFO L93 Difference]: Finished difference Result 4101 states and 6165 transitions. [2019-12-07 17:57:07,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:07,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 178 [2019-12-07 17:57:07,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:07,421 INFO L225 Difference]: With dead ends: 4101 [2019-12-07 17:57:07,421 INFO L226 Difference]: Without dead ends: 2325 [2019-12-07 17:57:07,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:07,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2325 states. [2019-12-07 17:57:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2325 to 1953. [2019-12-07 17:57:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1953 states. [2019-12-07 17:57:07,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1953 states to 1953 states and 2961 transitions. [2019-12-07 17:57:07,482 INFO L78 Accepts]: Start accepts. Automaton has 1953 states and 2961 transitions. Word has length 178 [2019-12-07 17:57:07,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:07,482 INFO L462 AbstractCegarLoop]: Abstraction has 1953 states and 2961 transitions. [2019-12-07 17:57:07,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1953 states and 2961 transitions. [2019-12-07 17:57:07,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 17:57:07,483 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:07,484 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:07,484 INFO L410 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:07,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:07,484 INFO L82 PathProgramCache]: Analyzing trace with hash 971087660, now seen corresponding path program 1 times [2019-12-07 17:57:07,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:07,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245722027] [2019-12-07 17:57:07,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:07,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:07,553 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2019-12-07 17:57:07,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245722027] [2019-12-07 17:57:07,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:07,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:57:07,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965740199] [2019-12-07 17:57:07,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:07,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:07,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:07,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:07,554 INFO L87 Difference]: Start difference. First operand 1953 states and 2961 transitions. Second operand 5 states. [2019-12-07 17:57:07,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:07,967 INFO L93 Difference]: Finished difference Result 4305 states and 6555 transitions. [2019-12-07 17:57:07,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:07,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 179 [2019-12-07 17:57:07,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:07,969 INFO L225 Difference]: With dead ends: 4305 [2019-12-07 17:57:07,969 INFO L226 Difference]: Without dead ends: 2371 [2019-12-07 17:57:07,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-12-07 17:57:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2061. [2019-12-07 17:57:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2019-12-07 17:57:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 3181 transitions. [2019-12-07 17:57:08,034 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 3181 transitions. Word has length 179 [2019-12-07 17:57:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:08,035 INFO L462 AbstractCegarLoop]: Abstraction has 2061 states and 3181 transitions. [2019-12-07 17:57:08,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:08,035 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 3181 transitions. [2019-12-07 17:57:08,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 17:57:08,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:08,036 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:08,036 INFO L410 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:08,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:08,036 INFO L82 PathProgramCache]: Analyzing trace with hash -759436381, now seen corresponding path program 1 times [2019-12-07 17:57:08,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:08,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581690015] [2019-12-07 17:57:08,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:08,285 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:57:08,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581690015] [2019-12-07 17:57:08,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659559433] [2019-12-07 17:57:08,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:08,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:08,409 INFO L264 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 17:57:08,415 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:08,442 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,442 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 17:57:08,442 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,474 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,475 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_177|], 2=[|v_#memory_$Pointer$.base_173|, |v_#memory_$Pointer$.base_172|]} [2019-12-07 17:57:08,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 17:57:08,507 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,524 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,529 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:08,535 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:57:08,535 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,570 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:57:08,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:57:08,571 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,580 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,581 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,581 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 17:57:08,611 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:57:08,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:57:08,612 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,617 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,617 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,617 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:57:08,638 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:57:08,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:57:08,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,644 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,645 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:57:08,646 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_174|], 12=[|v_#memory_$Pointer$.base_180|]} [2019-12-07 17:57:08,647 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:08,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,706 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:57:08,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:57:08,706 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,713 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,713 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,713 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:57:08,735 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:57:08,735 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:57:08,735 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,741 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,741 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,741 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:57:08,761 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:57:08,761 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:57:08,761 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,767 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,767 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,767 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:57:08,770 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_175|], 12=[|v_#memory_$Pointer$.base_183|]} [2019-12-07 17:57:08,772 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:08,782 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,815 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:57:08,816 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:57:08,816 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,823 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,823 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,823 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:57:08,827 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_181|], 2=[|v_#memory_$Pointer$.offset_160|], 12=[|v_#memory_$Pointer$.base_184|]} [2019-12-07 17:57:08,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-12-07 17:57:08,830 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,844 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 17:57:08,847 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:08,931 INFO L343 Elim1Store]: treesize reduction 36, result has 84.9 percent of original size [2019-12-07 17:57:08,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 123 treesize of output 263 [2019-12-07 17:57:08,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:08,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:08,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:57:08,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:57:08,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:08,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:08,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:57:08,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:08,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:08,935 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,997 INFO L614 ElimStorePlain]: treesize reduction 1074, result has 6.4 percent of original size [2019-12-07 17:57:08,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:08,997 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:182, output treesize:74 [2019-12-07 17:57:09,015 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2019-12-07 17:57:09,016 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:09,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:09,027 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 7 [2019-12-07 17:57:09,027 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:09,033 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:09,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:09,033 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:56 [2019-12-07 17:57:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 17:57:09,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:57:09,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-12-07 17:57:09,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137316312] [2019-12-07 17:57:09,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:57:09,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:09,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:57:09,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:57:09,146 INFO L87 Difference]: Start difference. First operand 2061 states and 3181 transitions. Second operand 5 states. [2019-12-07 17:57:09,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:09,981 INFO L93 Difference]: Finished difference Result 5147 states and 7918 transitions. [2019-12-07 17:57:09,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:57:09,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-12-07 17:57:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:09,983 INFO L225 Difference]: With dead ends: 5147 [2019-12-07 17:57:09,983 INFO L226 Difference]: Without dead ends: 3105 [2019-12-07 17:57:09,984 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:57:09,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3105 states. [2019-12-07 17:57:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3105 to 2065. [2019-12-07 17:57:10,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2065 states. [2019-12-07 17:57:10,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2065 states to 2065 states and 3185 transitions. [2019-12-07 17:57:10,049 INFO L78 Accepts]: Start accepts. Automaton has 2065 states and 3185 transitions. Word has length 192 [2019-12-07 17:57:10,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:10,050 INFO L462 AbstractCegarLoop]: Abstraction has 2065 states and 3185 transitions. [2019-12-07 17:57:10,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:57:10,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2065 states and 3185 transitions. [2019-12-07 17:57:10,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 17:57:10,051 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:10,051 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:10,251 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:10,252 INFO L410 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:10,253 INFO L82 PathProgramCache]: Analyzing trace with hash -640994907, now seen corresponding path program 1 times [2019-12-07 17:57:10,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:10,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703295947] [2019-12-07 17:57:10,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:10,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,478 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 209 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:57:10,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703295947] [2019-12-07 17:57:10,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073401840] [2019-12-07 17:57:10,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:10,593 INFO L264 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 45 conjunts are in the unsatisfiable core [2019-12-07 17:57:10,600 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:10,625 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,625 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2019-12-07 17:57:10,626 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,660 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_192|], 2=[|v_#memory_$Pointer$.base_186|, |v_#memory_$Pointer$.base_185|]} [2019-12-07 17:57:10,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,664 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,682 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 10 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 17:57:10,682 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,699 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:10,708 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:57:10,709 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,722 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,741 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:57:10,741 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:57:10,742 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,750 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,750 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,750 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:95, output treesize:53 [2019-12-07 17:57:10,781 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:57:10,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:57:10,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,787 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,787 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,787 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:57:10,808 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:57:10,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:57:10,809 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,815 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:57:10,816 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_187|], 12=[|v_#memory_$Pointer$.base_195|]} [2019-12-07 17:57:10,817 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:10,829 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,861 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:57:10,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:57:10,862 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,872 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,872 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:57:10,894 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:57:10,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:57:10,894 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,900 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,900 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,900 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:57:10,932 INFO L343 Elim1Store]: treesize reduction 132, result has 17.5 percent of original size [2019-12-07 17:57:10,932 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 44 [2019-12-07 17:57:10,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,938 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,938 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:53 [2019-12-07 17:57:10,941 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_188|], 12=[|v_#memory_$Pointer$.base_198|]} [2019-12-07 17:57:10,943 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:10,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,986 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:57:10,986 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:57:10,987 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,993 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:10,994 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:10,994 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:57:10,997 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_163|], 12=[|v_#memory_$Pointer$.base_199|]} [2019-12-07 17:57:10,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 17:57:11,000 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:11,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,080 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 17:57:11,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 17:57:11,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,082 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,101 INFO L614 ElimStorePlain]: treesize reduction 139, result has 27.6 percent of original size [2019-12-07 17:57:11,101 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,101 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 17:57:11,103 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_189|], 12=[|v_#memory_$Pointer$.base_200|]} [2019-12-07 17:57:11,104 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:11,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,148 INFO L343 Elim1Store]: treesize reduction 260, result has 12.5 percent of original size [2019-12-07 17:57:11,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 77 treesize of output 53 [2019-12-07 17:57:11,149 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,156 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:91, output treesize:53 [2019-12-07 17:57:11,159 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|], 12=[|v_#memory_$Pointer$.base_201|]} [2019-12-07 17:57:11,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 17:57:11,161 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:11,169 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,237 INFO L343 Elim1Store]: treesize reduction 36, result has 80.4 percent of original size [2019-12-07 17:57:11,237 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 182 [2019-12-07 17:57:11,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:57:11,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,242 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 17:57:11,292 INFO L614 ElimStorePlain]: treesize reduction 619, result has 7.9 percent of original size [2019-12-07 17:57:11,292 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,292 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:102, output treesize:53 [2019-12-07 17:57:11,294 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_182|], 2=[|v_#memory_$Pointer$.offset_162|, |v_#memory_$Pointer$.base_191|, |v_#memory_$Pointer$.offset_161|], 6=[|v_#memory_$Pointer$.base_190|], 12=[|v_#memory_$Pointer$.base_202|]} [2019-12-07 17:57:11,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 17:57:11,303 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,352 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,359 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 17:57:11,359 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,397 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:11,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 88 [2019-12-07 17:57:11,436 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,462 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,463 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:11,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,499 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 162 [2019-12-07 17:57:11,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,510 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 119 [2019-12-07 17:57:11,511 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,529 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,537 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,611 INFO L343 Elim1Store]: treesize reduction 152, result has 48.3 percent of original size [2019-12-07 17:57:11,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 158 treesize of output 179 [2019-12-07 17:57:11,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:57:11,613 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,638 INFO L614 ElimStorePlain]: treesize reduction 48, result has 68.4 percent of original size [2019-12-07 17:57:11,639 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,652 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,652 INFO L239 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:317, output treesize:92 [2019-12-07 17:57:11,676 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_165|], 6=[|v_#memory_$Pointer$.base_203|], 12=[|v_#memory_int_183|]} [2019-12-07 17:57:11,679 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 41 [2019-12-07 17:57:11,679 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:11,697 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:57:11,701 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 45 [2019-12-07 17:57:11,701 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:11,710 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,717 INFO L343 Elim1Store]: treesize reduction 39, result has 18.8 percent of original size [2019-12-07 17:57:11,717 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 17:57:11,718 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:11,723 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:11,723 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:11,723 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:123, output treesize:32 [2019-12-07 17:57:11,975 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 17:57:11,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:57:11,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-12-07 17:57:11,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023518324] [2019-12-07 17:57:11,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:57:11,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:57:11,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:57:11,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:57:11,976 INFO L87 Difference]: Start difference. First operand 2065 states and 3185 transitions. Second operand 10 states. [2019-12-07 17:57:13,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:13,909 INFO L93 Difference]: Finished difference Result 5595 states and 8564 transitions. [2019-12-07 17:57:13,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:57:13,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 192 [2019-12-07 17:57:13,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:13,912 INFO L225 Difference]: With dead ends: 5595 [2019-12-07 17:57:13,912 INFO L226 Difference]: Without dead ends: 3549 [2019-12-07 17:57:13,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:57:13,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3549 states. [2019-12-07 17:57:13,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3549 to 2377. [2019-12-07 17:57:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2019-12-07 17:57:13,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3737 transitions. [2019-12-07 17:57:13,986 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3737 transitions. Word has length 192 [2019-12-07 17:57:13,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:13,986 INFO L462 AbstractCegarLoop]: Abstraction has 2377 states and 3737 transitions. [2019-12-07 17:57:13,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:57:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3737 transitions. [2019-12-07 17:57:13,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-12-07 17:57:13,988 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:13,988 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:14,188 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:57:14,189 INFO L410 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:14,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:14,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1156893847, now seen corresponding path program 1 times [2019-12-07 17:57:14,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:57:14,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405612351] [2019-12-07 17:57:14,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:57:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:57:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:57:14,362 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:57:14,363 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:57:14,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:57:14 BoogieIcfgContainer [2019-12-07 17:57:14,470 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:57:14,470 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:57:14,470 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:57:14,470 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:57:14,471 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:56:17" (3/4) ... [2019-12-07 17:57:14,474 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:57:14,474 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:57:14,474 INFO L168 Benchmark]: Toolchain (without parser) took 58527.62 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 517.5 MB). Free memory was 935.5 MB in the beginning and 1.3 GB in the end (delta: -387.2 MB). Peak memory consumption was 130.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:57:14,475 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:57:14,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 441.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-12-07 17:57:14,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:57:14,475 INFO L168 Benchmark]: Boogie Preprocessor took 60.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:57:14,475 INFO L168 Benchmark]: RCFGBuilder took 699.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 956.5 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. [2019-12-07 17:57:14,476 INFO L168 Benchmark]: TraceAbstraction took 57254.05 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 421.0 MB). Free memory was 956.5 MB in the beginning and 1.3 GB in the end (delta: -366.1 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2019-12-07 17:57:14,476 INFO L168 Benchmark]: Witness Printer took 3.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:57:14,477 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 441.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.77 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 60.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 699.08 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 956.5 MB in the end (delta: 98.2 MB). Peak memory consumption was 98.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 57254.05 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 421.0 MB). Free memory was 956.5 MB in the beginning and 1.3 GB in the end (delta: -366.1 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. * Witness Printer took 3.70 ms. Allocated memory is still 1.5 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1762]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; VAL [init=1, SSLv3_server_data={6:0}] [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback VAL [init=1, SSLv3_server_data={6:0}] [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) VAL [init=1, SSLv3_server_data={6:0}] [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={6:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={6:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={6:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1352] COND TRUE s->hit [L1353] s->state = 8656 VAL [init=1, SSLv3_server_data={6:0}] [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND TRUE s->state == 8656 [L1598] EXPR s->session [L1598] EXPR s->s3 [L1598] EXPR (s->s3)->tmp.new_cipher [L1598] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1599] COND FALSE !(! tmp___9) [L1605] ret = __VERIFIER_nondet_int() [L1606] COND FALSE !(blastFlag == 10) VAL [init=1, SSLv3_server_data={6:0}] [L1609] COND FALSE !(blastFlag == 13) VAL [init=1, SSLv3_server_data={6:0}] [L1612] COND FALSE !(blastFlag == 16) VAL [init=1, SSLv3_server_data={6:0}] [L1619] COND FALSE !(ret <= 0) [L1624] s->state = 8672 [L1625] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1626] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={6:0}] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1235] COND TRUE s->state == 8672 [L1635] ret = __VERIFIER_nondet_int() [L1636] COND FALSE !(blastFlag == 11) VAL [init=1, SSLv3_server_data={6:0}] [L1639] COND FALSE !(blastFlag == 14) VAL [init=1, SSLv3_server_data={6:0}] [L1642] COND FALSE !(blastFlag == 17) VAL [init=1, SSLv3_server_data={6:0}] [L1649] COND FALSE !(ret <= 0) [L1654] s->state = 8448 [L1655] s->hit VAL [init=1, SSLv3_server_data={6:0}] [L1655] COND TRUE s->hit [L1656] EXPR s->s3 [L1656] (s->s3)->tmp.next_state = 8640 [L1660] s->init_num = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) VAL [init=1, SSLv3_server_data={6:0}] [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={6:0}] [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 VAL [init=1, SSLv3_server_data={6:0}] [L1136] COND TRUE 1 VAL [init=1, SSLv3_server_data={6:0}] [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={6:0}] [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) VAL [init=1, SSLv3_server_data={6:0}] [L1574] COND FALSE !(blastFlag == 12) VAL [init=1, SSLv3_server_data={6:0}] [L1577] COND FALSE !(blastFlag == 15) VAL [init=1, SSLv3_server_data={6:0}] [L1762] __VERIFIER_error() VAL [init=1, SSLv3_server_data={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 156 locations, 1 error locations. Result: UNSAFE, OverallTime: 57.1s, OverallIterations: 120, TraceHistogramMax: 7, AutomataDifference: 37.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 28015 SDtfs, 10245 SDslu, 44544 SDs, 0 SdLazy, 27838 SolverSat, 1515 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1241 GetRequests, 806 SyntacticMatches, 45 SemanticMatches, 390 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2377occurred in iteration=119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 119 MinimizatonAttempts, 10736 StatesRemovedByMinimization, 119 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 15398 NumberOfCodeBlocks, 15398 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 15077 ConstructedInterpolants, 112 QuantifiedInterpolants, 10086815 SizeOfPredicates, 33 NumberOfNonLiveVariables, 2004 ConjunctsInSsa, 119 ConjunctsInUnsatCore, 122 InterpolantComputations, 117 PerfectInterpolantSequences, 16265/17043 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 17:57:15,897 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:57:15,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:57:15,906 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:57:15,906 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:57:15,907 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:57:15,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:57:15,909 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:57:15,910 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:57:15,911 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:57:15,912 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:57:15,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:57:15,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:57:15,913 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:57:15,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:57:15,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:57:15,915 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:57:15,916 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:57:15,917 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:57:15,919 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:57:15,920 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:57:15,921 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:57:15,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:57:15,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:57:15,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:57:15,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:57:15,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:57:15,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:57:15,925 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:57:15,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:57:15,926 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:57:15,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:57:15,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:57:15,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:57:15,928 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:57:15,928 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:57:15,929 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:57:15,929 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:57:15,929 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:57:15,930 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:57:15,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:57:15,931 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 17:57:15,941 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:57:15,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:57:15,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:57:15,942 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:57:15,942 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:57:15,942 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:57:15,942 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:57:15,943 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:57:15,943 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:57:15,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:57:15,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:57:15,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:57:15,943 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:57:15,943 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:57:15,943 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:57:15,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:57:15,944 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:57:15,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:57:15,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:57:15,944 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:57:15,944 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:57:15,944 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:57:15,944 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:57:15,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:57:15,945 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:57:15,945 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:57:15,945 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 17:57:15,945 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:57:15,945 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:57:15,945 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:57:15,946 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:57:15,946 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_c0f11647-7c8c-4763-8c90-029d87d55532/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 -> 5d1ed5f95c4e8acd6cf76ffe908c8c8bb3dc8352 [2019-12-07 17:57:16,107 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:57:16,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:57:16,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:57:16,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:57:16,122 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:57:16,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c [2019-12-07 17:57:16,170 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/data/126137802/44cb4fe502bf449facc41c2b2740bac3/FLAG716d87ba9 [2019-12-07 17:57:16,641 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:57:16,642 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c [2019-12-07 17:57:16,658 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/data/126137802/44cb4fe502bf449facc41c2b2740bac3/FLAG716d87ba9 [2019-12-07 17:57:16,947 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/data/126137802/44cb4fe502bf449facc41c2b2740bac3 [2019-12-07 17:57:16,952 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:57:16,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:57:16,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:57:16,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:57:16,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:57:16,961 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:57:16" (1/1) ... [2019-12-07 17:57:16,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48ce1753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:16, skipping insertion in model container [2019-12-07 17:57:16,964 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:57:16" (1/1) ... [2019-12-07 17:57:16,970 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:57:17,013 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:57:17,322 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:57:17,338 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:57:17,407 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:57:17,422 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:57:17,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17 WrapperNode [2019-12-07 17:57:17,422 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:57:17,423 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:57:17,423 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:57:17,423 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:57:17,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (1/1) ... [2019-12-07 17:57:17,448 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (1/1) ... [2019-12-07 17:57:17,480 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:57:17,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:57:17,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:57:17,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:57:17,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (1/1) ... [2019-12-07 17:57:17,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (1/1) ... [2019-12-07 17:57:17,493 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (1/1) ... [2019-12-07 17:57:17,493 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (1/1) ... [2019-12-07 17:57:17,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (1/1) ... [2019-12-07 17:57:17,528 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (1/1) ... [2019-12-07 17:57:17,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (1/1) ... [2019-12-07 17:57:17,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:57:17,535 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:57:17,535 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:57:17,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:57:17,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:57:17,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:57:17,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:57:17,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 17:57:17,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:57:17,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:57:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:57:17,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:57:17,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 17:57:17,710 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 17:57:19,637 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-12-07 17:57:19,637 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-12-07 17:57:19,638 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:57:19,638 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 17:57:19,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:19 BoogieIcfgContainer [2019-12-07 17:57:19,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:57:19,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:57:19,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:57:19,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:57:19,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:57:16" (1/3) ... [2019-12-07 17:57:19,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca78a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:57:19, skipping insertion in model container [2019-12-07 17:57:19,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:57:17" (2/3) ... [2019-12-07 17:57:19,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ca78a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:57:19, skipping insertion in model container [2019-12-07 17:57:19,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:19" (3/3) ... [2019-12-07 17:57:19,644 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2019-12-07 17:57:19,650 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:57:19,655 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:57:19,663 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:57:19,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:57:19,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:57:19,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:57:19,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:57:19,682 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:57:19,682 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:57:19,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:57:19,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:57:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states. [2019-12-07 17:57:19,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:57:19,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:19,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:19,706 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash 102131673, now seen corresponding path program 1 times [2019-12-07 17:57:19,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:57:19,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [231342835] [2019-12-07 17:57:19,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 17:57:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:19,888 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:57:19,894 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:19,952 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:57:19,953 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:57:19,953 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:19,965 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:19,966 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:19,967 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:57:20,003 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:57:20,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:57:20,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:20,009 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:20,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:20,010 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:57:20,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:57:20,019 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:20,021 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:20,021 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:20,022 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:57:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:20,038 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:57:20,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:20,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [231342835] [2019-12-07 17:57:20,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:20,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 17:57:20,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974459926] [2019-12-07 17:57:20,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:20,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:57:20,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:20,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:20,078 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 4 states. [2019-12-07 17:57:22,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:22,585 INFO L93 Difference]: Finished difference Result 339 states and 579 transitions. [2019-12-07 17:57:22,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:22,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-12-07 17:57:22,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:22,596 INFO L225 Difference]: With dead ends: 339 [2019-12-07 17:57:22,597 INFO L226 Difference]: Without dead ends: 171 [2019-12-07 17:57:22,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:57:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-12-07 17:57:22,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2019-12-07 17:57:22,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:57:22,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 242 transitions. [2019-12-07 17:57:22,632 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 242 transitions. Word has length 43 [2019-12-07 17:57:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:22,632 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 242 transitions. [2019-12-07 17:57:22,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 242 transitions. [2019-12-07 17:57:22,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:57:22,634 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:22,634 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:22,835 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:57:22,836 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:22,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:22,836 INFO L82 PathProgramCache]: Analyzing trace with hash 862077968, now seen corresponding path program 1 times [2019-12-07 17:57:22,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:57:22,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1184167733] [2019-12-07 17:57:22,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 17:57:23,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:23,028 INFO L264 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:57:23,031 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:23,046 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:57:23,046 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:57:23,046 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:23,056 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:23,056 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:23,056 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:57:23,080 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:57:23,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:57:23,081 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:23,083 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:23,084 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:23,084 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:57:23,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:57:23,089 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:23,091 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:23,091 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:23,091 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:57:23,101 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:23,101 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:57:23,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:23,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1184167733] [2019-12-07 17:57:23,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:23,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:57:23,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659728681] [2019-12-07 17:57:23,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:57:23,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:57:23,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:57:23,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:23,135 INFO L87 Difference]: Start difference. First operand 154 states and 242 transitions. Second operand 6 states. [2019-12-07 17:57:28,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:28,704 INFO L93 Difference]: Finished difference Result 431 states and 673 transitions. [2019-12-07 17:57:28,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:28,705 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-07 17:57:28,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:28,707 INFO L225 Difference]: With dead ends: 431 [2019-12-07 17:57:28,707 INFO L226 Difference]: Without dead ends: 296 [2019-12-07 17:57:28,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:57:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2019-12-07 17:57:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 170. [2019-12-07 17:57:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-12-07 17:57:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 267 transitions. [2019-12-07 17:57:28,719 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 267 transitions. Word has length 56 [2019-12-07 17:57:28,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:28,719 INFO L462 AbstractCegarLoop]: Abstraction has 170 states and 267 transitions. [2019-12-07 17:57:28,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:57:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 267 transitions. [2019-12-07 17:57:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:57:28,721 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:28,721 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:28,922 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:57:28,923 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:28,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:28,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1995784866, now seen corresponding path program 1 times [2019-12-07 17:57:28,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:57:28,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [911096260] [2019-12-07 17:57:28,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 17:57:29,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:29,092 INFO L264 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:57:29,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:29,099 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_164|, |v_#memory_$Pointer$.base_164|], 4=[|v_#memory_int_188|]} [2019-12-07 17:57:29,101 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 85 [2019-12-07 17:57:29,102 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:29,112 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:29,114 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 49 [2019-12-07 17:57:29,115 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:57:29,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:29,162 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:29,162 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 55 [2019-12-07 17:57:29,163 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:37,325 WARN L192 SmtUtils]: Spent 8.16 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-07 17:57:37,325 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:37,326 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:37,326 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:109, output treesize:9 [2019-12-07 17:57:37,336 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:57:37,336 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:37,337 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:37,338 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:37,338 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:57:37,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:37,346 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:57:37,353 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:37,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [911096260] [2019-12-07 17:57:37,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:37,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 17:57:37,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293796468] [2019-12-07 17:57:37,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:57:37,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:57:37,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:57:37,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:57:37,354 INFO L87 Difference]: Start difference. First operand 170 states and 267 transitions. Second operand 4 states. [2019-12-07 17:57:40,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:40,848 INFO L93 Difference]: Finished difference Result 350 states and 548 transitions. [2019-12-07 17:57:40,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:57:40,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:57:40,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:40,851 INFO L225 Difference]: With dead ends: 350 [2019-12-07 17:57:40,852 INFO L226 Difference]: Without dead ends: 199 [2019-12-07 17:57:40,852 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 110 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-12-07 17:57:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-12-07 17:57:40,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2019-12-07 17:57:40,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-12-07 17:57:40,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2019-12-07 17:57:40,861 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 57 [2019-12-07 17:57:40,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:40,861 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2019-12-07 17:57:40,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:57:40,861 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2019-12-07 17:57:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:57:40,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:40,863 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:41,063 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:57:41,064 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:41,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:41,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1027351245, now seen corresponding path program 1 times [2019-12-07 17:57:41,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:57:41,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986477093] [2019-12-07 17:57:41,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 17:57:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:41,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:57:41,248 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:41,266 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:57:41,267 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:57:41,267 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:41,276 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:41,276 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:41,276 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:57:41,295 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:57:41,296 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:57:41,296 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:41,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:41,299 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:41,299 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:57:41,303 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:57:41,304 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:41,305 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:41,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:41,306 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:57:41,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:41,313 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:57:41,343 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:41,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986477093] [2019-12-07 17:57:41,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:41,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:57:41,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246635168] [2019-12-07 17:57:41,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:57:41,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:57:41,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:57:41,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:41,345 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 6 states. [2019-12-07 17:57:45,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:45,462 INFO L93 Difference]: Finished difference Result 477 states and 747 transitions. [2019-12-07 17:57:45,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:45,462 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-07 17:57:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:45,464 INFO L225 Difference]: With dead ends: 477 [2019-12-07 17:57:45,464 INFO L226 Difference]: Without dead ends: 310 [2019-12-07 17:57:45,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:57:45,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-12-07 17:57:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 187. [2019-12-07 17:57:45,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-12-07 17:57:45,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 293 transitions. [2019-12-07 17:57:45,471 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 293 transitions. Word has length 57 [2019-12-07 17:57:45,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:45,471 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 293 transitions. [2019-12-07 17:57:45,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:57:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 293 transitions. [2019-12-07 17:57:45,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:57:45,472 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:45,472 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:45,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:57:45,674 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:45,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1264395763, now seen corresponding path program 1 times [2019-12-07 17:57:45,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:57:45,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1293789908] [2019-12-07 17:57:45,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 17:57:45,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:45,787 INFO L264 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:57:45,789 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:45,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:57:45,793 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:45,795 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:45,795 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:45,795 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:57:45,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:57:45,804 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:45,805 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:45,806 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:45,806 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:57:45,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:45,815 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:57:45,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:45,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1293789908] [2019-12-07 17:57:45,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:45,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:57:45,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718183296] [2019-12-07 17:57:45,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:57:45,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:57:45,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:57:45,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:45,837 INFO L87 Difference]: Start difference. First operand 187 states and 293 transitions. Second operand 6 states. [2019-12-07 17:57:56,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:57:56,173 INFO L93 Difference]: Finished difference Result 591 states and 927 transitions. [2019-12-07 17:57:56,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:57:56,173 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-07 17:57:56,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:57:56,176 INFO L225 Difference]: With dead ends: 591 [2019-12-07 17:57:56,176 INFO L226 Difference]: Without dead ends: 423 [2019-12-07 17:57:56,176 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 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-12-07 17:57:56,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-07 17:57:56,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 227. [2019-12-07 17:57:56,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-12-07 17:57:56,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 364 transitions. [2019-12-07 17:57:56,185 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 364 transitions. Word has length 57 [2019-12-07 17:57:56,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:57:56,192 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 364 transitions. [2019-12-07 17:57:56,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:57:56,193 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 364 transitions. [2019-12-07 17:57:56,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:57:56,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:57:56,194 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:57:56,394 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:57:56,395 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:57:56,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:57:56,396 INFO L82 PathProgramCache]: Analyzing trace with hash 571387971, now seen corresponding path program 1 times [2019-12-07 17:57:56,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:57:56,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126477341] [2019-12-07 17:57:56,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 17:57:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:57:56,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:57:56,521 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:57:56,525 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:57:56,525 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:56,528 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:56,528 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:56,528 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:57:56,537 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:57:56,537 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:57:56,539 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:57:56,539 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:57:56,539 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:57:56,548 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:56,549 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:57:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:57:56,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126477341] [2019-12-07 17:57:56,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:57:56,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:57:56,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646976056] [2019-12-07 17:57:56,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:57:56,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:57:56,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:57:56,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:57:56,570 INFO L87 Difference]: Start difference. First operand 227 states and 364 transitions. Second operand 6 states. [2019-12-07 17:58:03,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:03,945 INFO L93 Difference]: Finished difference Result 645 states and 1029 transitions. [2019-12-07 17:58:03,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:03,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-07 17:58:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:03,948 INFO L225 Difference]: With dead ends: 645 [2019-12-07 17:58:03,948 INFO L226 Difference]: Without dead ends: 437 [2019-12-07 17:58:03,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 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-12-07 17:58:03,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-12-07 17:58:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 250. [2019-12-07 17:58:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2019-12-07 17:58:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 409 transitions. [2019-12-07 17:58:03,955 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 409 transitions. Word has length 58 [2019-12-07 17:58:03,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:03,955 INFO L462 AbstractCegarLoop]: Abstraction has 250 states and 409 transitions. [2019-12-07 17:58:03,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 409 transitions. [2019-12-07 17:58:03,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 17:58:03,956 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:03,956 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:04,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 17:58:04,157 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:04,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:04,158 INFO L82 PathProgramCache]: Analyzing trace with hash 2063186551, now seen corresponding path program 1 times [2019-12-07 17:58:04,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:04,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064742001] [2019-12-07 17:58:04,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:04,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:04,376 INFO L264 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:58:04,378 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:04,382 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:58:04,382 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:04,385 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:04,385 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:04,385 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:58:04,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:58:04,392 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:04,394 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:04,394 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:04,394 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:58:04,405 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:04,406 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:58:04,430 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:04,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064742001] [2019-12-07 17:58:04,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:04,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:58:04,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528259205] [2019-12-07 17:58:04,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:04,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:58:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:04,431 INFO L87 Difference]: Start difference. First operand 250 states and 409 transitions. Second operand 6 states. [2019-12-07 17:58:10,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:10,478 INFO L93 Difference]: Finished difference Result 741 states and 1206 transitions. [2019-12-07 17:58:10,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:10,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-07 17:58:10,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:10,481 INFO L225 Difference]: With dead ends: 741 [2019-12-07 17:58:10,481 INFO L226 Difference]: Without dead ends: 510 [2019-12-07 17:58:10,482 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 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-12-07 17:58:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-12-07 17:58:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 314. [2019-12-07 17:58:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2019-12-07 17:58:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 521 transitions. [2019-12-07 17:58:10,489 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 521 transitions. Word has length 86 [2019-12-07 17:58:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:10,489 INFO L462 AbstractCegarLoop]: Abstraction has 314 states and 521 transitions. [2019-12-07 17:58:10,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:10,489 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 521 transitions. [2019-12-07 17:58:10,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-07 17:58:10,490 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:10,490 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:10,690 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 17:58:10,691 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:10,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:10,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1936031392, now seen corresponding path program 1 times [2019-12-07 17:58:10,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:10,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510980145] [2019-12-07 17:58:10,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:10,798 INFO L264 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:58:10,801 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:10,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:58:10,806 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:10,809 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:10,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:10,809 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:58:10,818 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:58:10,819 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:10,820 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:10,821 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:10,821 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:58:10,835 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:10,835 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:58:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:10,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510980145] [2019-12-07 17:58:10,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:10,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:58:10,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875230159] [2019-12-07 17:58:10,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:10,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:58:10,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:10,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:10,864 INFO L87 Difference]: Start difference. First operand 314 states and 521 transitions. Second operand 6 states. [2019-12-07 17:58:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:19,282 INFO L93 Difference]: Finished difference Result 833 states and 1361 transitions. [2019-12-07 17:58:19,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:19,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-07 17:58:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:19,285 INFO L225 Difference]: With dead ends: 833 [2019-12-07 17:58:19,285 INFO L226 Difference]: Without dead ends: 538 [2019-12-07 17:58:19,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 178 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-12-07 17:58:19,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-12-07 17:58:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 351. [2019-12-07 17:58:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-12-07 17:58:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 585 transitions. [2019-12-07 17:58:19,294 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 585 transitions. Word has length 92 [2019-12-07 17:58:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:19,295 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 585 transitions. [2019-12-07 17:58:19,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 585 transitions. [2019-12-07 17:58:19,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-07 17:58:19,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:19,296 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:19,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 17:58:19,497 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:19,498 INFO L82 PathProgramCache]: Analyzing trace with hash 162131658, now seen corresponding path program 1 times [2019-12-07 17:58:19,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:19,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [283159928] [2019-12-07 17:58:19,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:19,674 INFO L264 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:58:19,675 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:19,678 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:58:19,679 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:19,681 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:19,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:19,682 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:58:19,690 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:58:19,690 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:19,691 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:19,691 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:19,692 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:58:19,704 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:19,704 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:58:19,731 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:19,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [283159928] [2019-12-07 17:58:19,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:19,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:58:19,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58267969] [2019-12-07 17:58:19,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:19,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:58:19,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:19,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:19,732 INFO L87 Difference]: Start difference. First operand 351 states and 585 transitions. Second operand 6 states. [2019-12-07 17:58:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:29,991 INFO L93 Difference]: Finished difference Result 864 states and 1414 transitions. [2019-12-07 17:58:29,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:29,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-07 17:58:29,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:29,994 INFO L225 Difference]: With dead ends: 864 [2019-12-07 17:58:29,994 INFO L226 Difference]: Without dead ends: 532 [2019-12-07 17:58:29,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 180 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-12-07 17:58:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states. [2019-12-07 17:58:30,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 351. [2019-12-07 17:58:30,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-12-07 17:58:30,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 583 transitions. [2019-12-07 17:58:30,003 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 583 transitions. Word has length 93 [2019-12-07 17:58:30,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:30,003 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 583 transitions. [2019-12-07 17:58:30,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:30,003 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 583 transitions. [2019-12-07 17:58:30,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 17:58:30,004 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:30,004 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:30,204 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 17:58:30,205 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:30,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:30,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2109661917, now seen corresponding path program 1 times [2019-12-07 17:58:30,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:30,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2139049280] [2019-12-07 17:58:30,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:30,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:30,450 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:58:30,452 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:30,472 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:58:30,472 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:58:30,472 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:30,481 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:30,481 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:30,481 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:58:30,499 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:58:30,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:58:30,500 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:30,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:30,503 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:30,503 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:58:30,505 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:58:30,506 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:30,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:30,507 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:30,507 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:58:30,517 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:58:30,517 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:58:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:58:30,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2139049280] [2019-12-07 17:58:30,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:30,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:58:30,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643888392] [2019-12-07 17:58:30,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:30,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:58:30,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:30,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:30,548 INFO L87 Difference]: Start difference. First operand 351 states and 583 transitions. Second operand 6 states. [2019-12-07 17:58:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:36,070 INFO L93 Difference]: Finished difference Result 781 states and 1278 transitions. [2019-12-07 17:58:36,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:36,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 17:58:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:36,073 INFO L225 Difference]: With dead ends: 781 [2019-12-07 17:58:36,073 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 17:58:36,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:58:36,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 17:58:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 351. [2019-12-07 17:58:36,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-12-07 17:58:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 576 transitions. [2019-12-07 17:58:36,079 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 576 transitions. Word has length 99 [2019-12-07 17:58:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:36,080 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 576 transitions. [2019-12-07 17:58:36,080 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 576 transitions. [2019-12-07 17:58:36,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-07 17:58:36,080 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:36,081 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:36,281 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 17:58:36,282 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:36,282 INFO L82 PathProgramCache]: Analyzing trace with hash 779601521, now seen corresponding path program 1 times [2019-12-07 17:58:36,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:36,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [513039695] [2019-12-07 17:58:36,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:36,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:36,536 INFO L264 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:58:36,538 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:36,552 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:58:36,552 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:58:36,552 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:36,560 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:36,561 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:36,561 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:58:36,579 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:58:36,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:58:36,580 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:36,582 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:36,582 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:36,582 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:58:36,585 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:58:36,585 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:36,587 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:36,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:36,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:58:36,597 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:58:36,597 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:58:36,631 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:58:36,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [513039695] [2019-12-07 17:58:36,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:36,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:58:36,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530498398] [2019-12-07 17:58:36,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:36,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:58:36,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:36,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:36,632 INFO L87 Difference]: Start difference. First operand 351 states and 576 transitions. Second operand 6 states. [2019-12-07 17:58:43,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:43,975 INFO L93 Difference]: Finished difference Result 781 states and 1265 transitions. [2019-12-07 17:58:43,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:43,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-07 17:58:43,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:43,978 INFO L225 Difference]: With dead ends: 781 [2019-12-07 17:58:43,978 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 17:58:43,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 191 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:58:43,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 17:58:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 351. [2019-12-07 17:58:43,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-12-07 17:58:43,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 569 transitions. [2019-12-07 17:58:43,992 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 569 transitions. Word has length 99 [2019-12-07 17:58:43,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:43,993 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 569 transitions. [2019-12-07 17:58:43,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:43,993 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 569 transitions. [2019-12-07 17:58:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 17:58:43,993 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:43,994 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:44,194 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 17:58:44,194 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:44,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:44,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1162233260, now seen corresponding path program 1 times [2019-12-07 17:58:44,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:44,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074617657] [2019-12-07 17:58:44,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:44,394 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:58:44,395 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:44,410 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:58:44,410 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:58:44,410 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:44,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:44,418 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:44,419 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:58:44,438 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:58:44,438 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:58:44,438 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:44,441 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:44,441 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:44,441 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:58:44,444 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:58:44,444 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:44,445 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:44,445 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:44,445 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:58:44,455 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:58:44,455 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:58:44,482 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:58:44,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074617657] [2019-12-07 17:58:44,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:44,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:58:44,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126315074] [2019-12-07 17:58:44,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:44,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:58:44,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:44,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:44,483 INFO L87 Difference]: Start difference. First operand 351 states and 569 transitions. Second operand 6 states. [2019-12-07 17:58:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:47,917 INFO L93 Difference]: Finished difference Result 781 states and 1252 transitions. [2019-12-07 17:58:47,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:47,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 17:58:47,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:47,919 INFO L225 Difference]: With dead ends: 781 [2019-12-07 17:58:47,919 INFO L226 Difference]: Without dead ends: 449 [2019-12-07 17:58:47,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:58:47,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-12-07 17:58:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 351. [2019-12-07 17:58:47,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2019-12-07 17:58:47,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 562 transitions. [2019-12-07 17:58:47,926 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 562 transitions. Word has length 100 [2019-12-07 17:58:47,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:47,926 INFO L462 AbstractCegarLoop]: Abstraction has 351 states and 562 transitions. [2019-12-07 17:58:47,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:47,926 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 562 transitions. [2019-12-07 17:58:47,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-12-07 17:58:47,927 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:47,927 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:48,127 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 17:58:48,128 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1801049323, now seen corresponding path program 1 times [2019-12-07 17:58:48,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:48,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1686684444] [2019-12-07 17:58:48,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:48,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:58:48,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:48,321 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:58:48,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:48,324 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:48,324 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:48,324 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:58:48,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:58:48,332 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:48,333 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:48,334 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:48,334 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:58:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:48,348 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:58:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:58:48,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1686684444] [2019-12-07 17:58:48,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:48,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:58:48,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114087484] [2019-12-07 17:58:48,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:48,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:58:48,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:48,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:48,373 INFO L87 Difference]: Start difference. First operand 351 states and 562 transitions. Second operand 6 states. [2019-12-07 17:58:53,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:58:53,595 INFO L93 Difference]: Finished difference Result 902 states and 1430 transitions. [2019-12-07 17:58:53,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:58:53,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-12-07 17:58:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:58:53,598 INFO L225 Difference]: With dead ends: 902 [2019-12-07 17:58:53,598 INFO L226 Difference]: Without dead ends: 570 [2019-12-07 17:58:53,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 194 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-12-07 17:58:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-12-07 17:58:53,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 394. [2019-12-07 17:58:53,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-12-07 17:58:53,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 632 transitions. [2019-12-07 17:58:53,606 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 632 transitions. Word has length 100 [2019-12-07 17:58:53,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:58:53,606 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 632 transitions. [2019-12-07 17:58:53,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:58:53,606 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 632 transitions. [2019-12-07 17:58:53,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 17:58:53,607 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:58:53,607 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:58:53,807 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 17:58:53,808 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:58:53,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:58:53,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1138564054, now seen corresponding path program 1 times [2019-12-07 17:58:53,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:58:53,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711351631] [2019-12-07 17:58:53,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-12-07 17:58:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:58:54,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:58:54,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:58:54,089 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:58:54,090 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:58:54,090 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:54,098 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:54,099 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:54,099 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:58:54,117 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:58:54,117 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:58:54,117 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:54,120 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:54,120 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:54,120 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:58:54,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:58:54,123 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:58:54,125 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:58:54,125 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:58:54,126 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:58:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:58:54,136 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:58:54,165 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:58:54,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711351631] [2019-12-07 17:58:54,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:58:54,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:58:54,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713750581] [2019-12-07 17:58:54,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:58:54,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:58:54,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:58:54,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:58:54,166 INFO L87 Difference]: Start difference. First operand 394 states and 632 transitions. Second operand 6 states. [2019-12-07 17:59:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:00,842 INFO L93 Difference]: Finished difference Result 867 states and 1379 transitions. [2019-12-07 17:59:00,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:00,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-07 17:59:00,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:00,845 INFO L225 Difference]: With dead ends: 867 [2019-12-07 17:59:00,845 INFO L226 Difference]: Without dead ends: 492 [2019-12-07 17:59:00,845 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 195 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:00,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2019-12-07 17:59:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 394. [2019-12-07 17:59:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2019-12-07 17:59:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 624 transitions. [2019-12-07 17:59:00,852 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 624 transitions. Word has length 101 [2019-12-07 17:59:00,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:00,852 INFO L462 AbstractCegarLoop]: Abstraction has 394 states and 624 transitions. [2019-12-07 17:59:00,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 624 transitions. [2019-12-07 17:59:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 17:59:00,853 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:00,853 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:01,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 17:59:01,054 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:01,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:01,054 INFO L82 PathProgramCache]: Analyzing trace with hash -517978017, now seen corresponding path program 1 times [2019-12-07 17:59:01,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:01,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354325636] [2019-12-07 17:59:01,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:01,188 INFO L264 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:01,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:01,192 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:01,192 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:01,194 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:01,195 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:01,195 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:01,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:01,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:01,204 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:01,204 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:01,205 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:01,219 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:01,219 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:01,246 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:59:01,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354325636] [2019-12-07 17:59:01,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:01,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:01,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935488366] [2019-12-07 17:59:01,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:01,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:01,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:01,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:01,247 INFO L87 Difference]: Start difference. First operand 394 states and 624 transitions. Second operand 6 states. [2019-12-07 17:59:05,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:05,619 INFO L93 Difference]: Finished difference Result 943 states and 1480 transitions. [2019-12-07 17:59:05,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:05,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-12-07 17:59:05,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:05,623 INFO L225 Difference]: With dead ends: 943 [2019-12-07 17:59:05,623 INFO L226 Difference]: Without dead ends: 564 [2019-12-07 17:59:05,623 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 196 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-12-07 17:59:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-12-07 17:59:05,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 396. [2019-12-07 17:59:05,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-12-07 17:59:05,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 627 transitions. [2019-12-07 17:59:05,630 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 627 transitions. Word has length 101 [2019-12-07 17:59:05,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:05,630 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 627 transitions. [2019-12-07 17:59:05,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:05,630 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 627 transitions. [2019-12-07 17:59:05,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 17:59:05,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:05,631 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:05,832 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 17:59:05,833 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:05,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:05,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1816970137, now seen corresponding path program 1 times [2019-12-07 17:59:05,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:05,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076105716] [2019-12-07 17:59:05,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:06,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:06,110 INFO L264 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:59:06,112 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:06,126 INFO L343 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2019-12-07 17:59:06,127 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2019-12-07 17:59:06,127 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:06,135 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:06,135 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:06,135 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:9 [2019-12-07 17:59:06,154 INFO L343 Elim1Store]: treesize reduction 41, result has 18.0 percent of original size [2019-12-07 17:59:06,154 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 24 [2019-12-07 17:59:06,154 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:06,156 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:06,157 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:06,157 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:9 [2019-12-07 17:59:06,161 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:06,161 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:06,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:06,162 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:06,163 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 17:59:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:59:06,173 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 17:59:06,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076105716] [2019-12-07 17:59:06,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:06,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:06,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729012478] [2019-12-07 17:59:06,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:06,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:06,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:06,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:06,203 INFO L87 Difference]: Start difference. First operand 396 states and 627 transitions. Second operand 6 states. [2019-12-07 17:59:12,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:12,974 INFO L93 Difference]: Finished difference Result 847 states and 1337 transitions. [2019-12-07 17:59:12,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:12,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-12-07 17:59:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:12,977 INFO L225 Difference]: With dead ends: 847 [2019-12-07 17:59:12,977 INFO L226 Difference]: Without dead ends: 470 [2019-12-07 17:59:12,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:59:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2019-12-07 17:59:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 396. [2019-12-07 17:59:12,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2019-12-07 17:59:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 619 transitions. [2019-12-07 17:59:12,984 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 619 transitions. Word has length 102 [2019-12-07 17:59:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:12,984 INFO L462 AbstractCegarLoop]: Abstraction has 396 states and 619 transitions. [2019-12-07 17:59:12,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 619 transitions. [2019-12-07 17:59:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-12-07 17:59:12,985 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:12,985 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:13,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 17:59:13,186 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:13,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:13,187 INFO L82 PathProgramCache]: Analyzing trace with hash -449993941, now seen corresponding path program 1 times [2019-12-07 17:59:13,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:13,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1585181948] [2019-12-07 17:59:13,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:13,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:13,325 INFO L264 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:13,326 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:13,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:13,330 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:13,332 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:13,332 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:13,332 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:13,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:13,339 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:13,340 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:13,340 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:13,341 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:59:13,355 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:59:13,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1585181948] [2019-12-07 17:59:13,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:13,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:13,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174636032] [2019-12-07 17:59:13,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:13,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:13,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:13,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:13,380 INFO L87 Difference]: Start difference. First operand 396 states and 619 transitions. Second operand 6 states. [2019-12-07 17:59:21,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:21,838 INFO L93 Difference]: Finished difference Result 963 states and 1500 transitions. [2019-12-07 17:59:21,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:21,839 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2019-12-07 17:59:21,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:21,841 INFO L225 Difference]: With dead ends: 963 [2019-12-07 17:59:21,841 INFO L226 Difference]: Without dead ends: 586 [2019-12-07 17:59:21,841 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 220 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-12-07 17:59:21,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-12-07 17:59:21,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 426. [2019-12-07 17:59:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-07 17:59:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 661 transitions. [2019-12-07 17:59:21,849 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 661 transitions. Word has length 113 [2019-12-07 17:59:21,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:21,850 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 661 transitions. [2019-12-07 17:59:21,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 661 transitions. [2019-12-07 17:59:21,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 17:59:21,851 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:21,851 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:22,051 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 17:59:22,052 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:22,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:22,053 INFO L82 PathProgramCache]: Analyzing trace with hash -539197754, now seen corresponding path program 1 times [2019-12-07 17:59:22,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:22,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [888384618] [2019-12-07 17:59:22,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:22,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:22,239 INFO L264 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:22,240 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:22,244 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:22,244 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:22,246 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:22,247 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:22,247 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:22,254 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:22,254 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:22,255 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:22,255 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:22,255 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:22,270 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:59:22,270 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:59:22,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [888384618] [2019-12-07 17:59:22,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:22,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:22,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365986034] [2019-12-07 17:59:22,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:22,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:22,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:22,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:22,296 INFO L87 Difference]: Start difference. First operand 426 states and 661 transitions. Second operand 6 states. [2019-12-07 17:59:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:30,872 INFO L93 Difference]: Finished difference Result 979 states and 1515 transitions. [2019-12-07 17:59:30,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:30,873 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-12-07 17:59:30,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:30,875 INFO L225 Difference]: With dead ends: 979 [2019-12-07 17:59:30,875 INFO L226 Difference]: Without dead ends: 572 [2019-12-07 17:59:30,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 222 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-12-07 17:59:30,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-12-07 17:59:30,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 426. [2019-12-07 17:59:30,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2019-12-07 17:59:30,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 655 transitions. [2019-12-07 17:59:30,883 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 655 transitions. Word has length 114 [2019-12-07 17:59:30,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:30,883 INFO L462 AbstractCegarLoop]: Abstraction has 426 states and 655 transitions. [2019-12-07 17:59:30,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:30,883 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 655 transitions. [2019-12-07 17:59:30,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-12-07 17:59:30,884 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:30,884 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:31,084 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 17:59:31,085 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:31,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:31,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1742878384, now seen corresponding path program 1 times [2019-12-07 17:59:31,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:31,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938853441] [2019-12-07 17:59:31,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:31,236 INFO L264 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:31,238 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:31,241 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:31,241 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:31,243 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:31,243 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:31,244 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:31,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:31,250 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:31,251 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:31,251 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:31,251 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:59:31,266 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:59:31,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938853441] [2019-12-07 17:59:31,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:31,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:31,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663745327] [2019-12-07 17:59:31,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:31,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:31,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:31,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:31,304 INFO L87 Difference]: Start difference. First operand 426 states and 655 transitions. Second operand 6 states. [2019-12-07 17:59:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:39,752 INFO L93 Difference]: Finished difference Result 1021 states and 1566 transitions. [2019-12-07 17:59:39,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:39,753 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-12-07 17:59:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:39,755 INFO L225 Difference]: With dead ends: 1021 [2019-12-07 17:59:39,755 INFO L226 Difference]: Without dead ends: 614 [2019-12-07 17:59:39,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 228 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-12-07 17:59:39,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-12-07 17:59:39,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 454. [2019-12-07 17:59:39,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-12-07 17:59:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 692 transitions. [2019-12-07 17:59:39,764 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 692 transitions. Word has length 117 [2019-12-07 17:59:39,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:39,764 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 692 transitions. [2019-12-07 17:59:39,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:39,764 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 692 transitions. [2019-12-07 17:59:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 17:59:39,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:39,765 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:39,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 17:59:39,966 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:39,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:39,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1435805387, now seen corresponding path program 1 times [2019-12-07 17:59:39,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:39,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050706932] [2019-12-07 17:59:39,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:40,124 INFO L264 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:40,126 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:40,129 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:40,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:40,131 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:40,132 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:40,132 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:40,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:40,138 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:40,140 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:40,140 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:40,140 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:40,157 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:59:40,157 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-12-07 17:59:40,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050706932] [2019-12-07 17:59:40,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:40,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:40,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245971936] [2019-12-07 17:59:40,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:40,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:40,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:40,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:40,187 INFO L87 Difference]: Start difference. First operand 454 states and 692 transitions. Second operand 6 states. [2019-12-07 17:59:46,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:46,148 INFO L93 Difference]: Finished difference Result 1027 states and 1562 transitions. [2019-12-07 17:59:46,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:46,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-12-07 17:59:46,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:46,150 INFO L225 Difference]: With dead ends: 1027 [2019-12-07 17:59:46,150 INFO L226 Difference]: Without dead ends: 592 [2019-12-07 17:59:46,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 230 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-12-07 17:59:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-12-07 17:59:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 454. [2019-12-07 17:59:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-12-07 17:59:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 685 transitions. [2019-12-07 17:59:46,161 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 685 transitions. Word has length 118 [2019-12-07 17:59:46,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:46,161 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 685 transitions. [2019-12-07 17:59:46,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:46,161 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 685 transitions. [2019-12-07 17:59:46,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 17:59:46,162 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:46,162 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:46,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 17:59:46,364 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:46,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:46,364 INFO L82 PathProgramCache]: Analyzing trace with hash 626963493, now seen corresponding path program 1 times [2019-12-07 17:59:46,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:46,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1604614260] [2019-12-07 17:59:46,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:46,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:46,578 INFO L264 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:46,580 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:46,584 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:46,584 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:46,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:46,593 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:46,594 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,595 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:46,595 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:46,595 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:59:46,611 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:59:46,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1604614260] [2019-12-07 17:59:46,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:46,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:46,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009002022] [2019-12-07 17:59:46,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:46,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:46,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:46,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:46,639 INFO L87 Difference]: Start difference. First operand 454 states and 685 transitions. Second operand 6 states. [2019-12-07 17:59:52,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:59:52,283 INFO L93 Difference]: Finished difference Result 1069 states and 1609 transitions. [2019-12-07 17:59:52,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:59:52,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-12-07 17:59:52,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:59:52,286 INFO L225 Difference]: With dead ends: 1069 [2019-12-07 17:59:52,286 INFO L226 Difference]: Without dead ends: 634 [2019-12-07 17:59:52,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 244 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-12-07 17:59:52,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-12-07 17:59:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 489. [2019-12-07 17:59:52,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-12-07 17:59:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 734 transitions. [2019-12-07 17:59:52,297 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 734 transitions. Word has length 125 [2019-12-07 17:59:52,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:59:52,298 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 734 transitions. [2019-12-07 17:59:52,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:59:52,298 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 734 transitions. [2019-12-07 17:59:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-12-07 17:59:52,299 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:59:52,299 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:59:52,499 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 17:59:52,500 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:59:52,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:59:52,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1297858715, now seen corresponding path program 1 times [2019-12-07 17:59:52,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:59:52,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474530381] [2019-12-07 17:59:52,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-12-07 17:59:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:59:52,625 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:59:52,626 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:59:52,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 17:59:52,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:52,632 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:52,632 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:52,632 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 17:59:52,639 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 17:59:52,639 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:59:52,640 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:59:52,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:59:52,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 17:59:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:59:52,657 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:59:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:59:52,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474530381] [2019-12-07 17:59:52,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:59:52,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 17:59:52,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605818926] [2019-12-07 17:59:52,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:59:52,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:59:52,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:59:52,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:59:52,686 INFO L87 Difference]: Start difference. First operand 489 states and 734 transitions. Second operand 6 states. [2019-12-07 18:00:01,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:01,471 INFO L93 Difference]: Finished difference Result 1094 states and 1640 transitions. [2019-12-07 18:00:01,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:01,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-12-07 18:00:01,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:01,474 INFO L225 Difference]: With dead ends: 1094 [2019-12-07 18:00:01,474 INFO L226 Difference]: Without dead ends: 624 [2019-12-07 18:00:01,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 246 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-12-07 18:00:01,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2019-12-07 18:00:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 489. [2019-12-07 18:00:01,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2019-12-07 18:00:01,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 730 transitions. [2019-12-07 18:00:01,483 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 730 transitions. Word has length 126 [2019-12-07 18:00:01,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:01,483 INFO L462 AbstractCegarLoop]: Abstraction has 489 states and 730 transitions. [2019-12-07 18:00:01,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:01,483 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 730 transitions. [2019-12-07 18:00:01,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-12-07 18:00:01,484 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:01,484 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:01,685 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 18:00:01,685 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:01,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:01,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1902979581, now seen corresponding path program 1 times [2019-12-07 18:00:01,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:01,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1975725943] [2019-12-07 18:00:01,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:01,897 INFO L264 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:01,899 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:01,902 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:01,902 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:01,906 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:01,906 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:01,906 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:01,914 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:01,914 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:01,915 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:01,915 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:01,915 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:01,936 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:00:01,936 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 100 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:00:01,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1975725943] [2019-12-07 18:00:01,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:01,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:01,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403999331] [2019-12-07 18:00:01,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:01,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:01,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:01,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:01,973 INFO L87 Difference]: Start difference. First operand 489 states and 730 transitions. Second operand 6 states. [2019-12-07 18:00:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:08,722 INFO L93 Difference]: Finished difference Result 1137 states and 1692 transitions. [2019-12-07 18:00:08,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:08,723 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-12-07 18:00:08,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:08,725 INFO L225 Difference]: With dead ends: 1137 [2019-12-07 18:00:08,726 INFO L226 Difference]: Without dead ends: 667 [2019-12-07 18:00:08,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 276 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-12-07 18:00:08,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2019-12-07 18:00:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 532. [2019-12-07 18:00:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-12-07 18:00:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 789 transitions. [2019-12-07 18:00:08,736 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 789 transitions. Word has length 141 [2019-12-07 18:00:08,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:08,736 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 789 transitions. [2019-12-07 18:00:08,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 789 transitions. [2019-12-07 18:00:08,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-12-07 18:00:08,737 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:08,737 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:08,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 18:00:08,937 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:08,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:08,938 INFO L82 PathProgramCache]: Analyzing trace with hash 685052057, now seen corresponding path program 1 times [2019-12-07 18:00:08,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:08,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443106427] [2019-12-07 18:00:08,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 25 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:09,070 INFO L264 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:09,072 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:09,075 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:09,075 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:09,078 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:09,078 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:09,079 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:09,087 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:09,088 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:09,089 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:09,089 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:09,089 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:09,111 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:00:09,111 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:00:09,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443106427] [2019-12-07 18:00:09,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:09,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:09,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883724473] [2019-12-07 18:00:09,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:09,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:09,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:09,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:09,148 INFO L87 Difference]: Start difference. First operand 532 states and 789 transitions. Second operand 6 states. [2019-12-07 18:00:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:14,343 INFO L93 Difference]: Finished difference Result 1178 states and 1746 transitions. [2019-12-07 18:00:14,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:14,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-12-07 18:00:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:14,346 INFO L225 Difference]: With dead ends: 1178 [2019-12-07 18:00:14,346 INFO L226 Difference]: Without dead ends: 649 [2019-12-07 18:00:14,347 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 278 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-12-07 18:00:14,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-12-07 18:00:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 524. [2019-12-07 18:00:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2019-12-07 18:00:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 775 transitions. [2019-12-07 18:00:14,356 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 775 transitions. Word has length 142 [2019-12-07 18:00:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:14,356 INFO L462 AbstractCegarLoop]: Abstraction has 524 states and 775 transitions. [2019-12-07 18:00:14,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 775 transitions. [2019-12-07 18:00:14,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 18:00:14,357 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:14,357 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:14,557 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 18:00:14,558 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:14,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1399908234, now seen corresponding path program 1 times [2019-12-07 18:00:14,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:14,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526693471] [2019-12-07 18:00:14,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 26 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:14,776 INFO L264 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:14,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:14,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:14,781 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:14,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:14,783 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:14,783 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:14,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:14,789 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:14,791 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:14,791 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:14,791 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:00:14,809 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:14,836 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:00:14,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526693471] [2019-12-07 18:00:14,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:14,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:14,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150695448] [2019-12-07 18:00:14,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:14,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:14,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:14,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:14,838 INFO L87 Difference]: Start difference. First operand 524 states and 775 transitions. Second operand 6 states. [2019-12-07 18:00:21,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:21,001 INFO L93 Difference]: Finished difference Result 1188 states and 1759 transitions. [2019-12-07 18:00:21,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:21,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-12-07 18:00:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:21,005 INFO L225 Difference]: With dead ends: 1188 [2019-12-07 18:00:21,005 INFO L226 Difference]: Without dead ends: 683 [2019-12-07 18:00:21,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 284 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-12-07 18:00:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-07 18:00:21,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 550. [2019-12-07 18:00:21,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-07 18:00:21,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 805 transitions. [2019-12-07 18:00:21,015 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 805 transitions. Word has length 145 [2019-12-07 18:00:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:21,015 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 805 transitions. [2019-12-07 18:00:21,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:21,015 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 805 transitions. [2019-12-07 18:00:21,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 18:00:21,016 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:21,016 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:21,216 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 18:00:21,217 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:21,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:21,217 INFO L82 PathProgramCache]: Analyzing trace with hash -639279407, now seen corresponding path program 1 times [2019-12-07 18:00:21,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:21,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1672981567] [2019-12-07 18:00:21,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 27 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:21,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:21,347 INFO L264 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:21,348 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:21,351 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:21,351 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:21,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:21,354 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:21,354 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:21,360 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:21,361 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:21,362 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:21,362 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:21,362 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:21,380 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:00:21,381 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 106 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-12-07 18:00:21,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1672981567] [2019-12-07 18:00:21,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:21,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:21,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394837151] [2019-12-07 18:00:21,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:21,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:21,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:21,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:21,411 INFO L87 Difference]: Start difference. First operand 550 states and 805 transitions. Second operand 6 states. [2019-12-07 18:00:29,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:29,014 INFO L93 Difference]: Finished difference Result 1204 states and 1765 transitions. [2019-12-07 18:00:29,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:29,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-12-07 18:00:29,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:29,017 INFO L225 Difference]: With dead ends: 1204 [2019-12-07 18:00:29,017 INFO L226 Difference]: Without dead ends: 673 [2019-12-07 18:00:29,018 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 286 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-12-07 18:00:29,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2019-12-07 18:00:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 550. [2019-12-07 18:00:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-07 18:00:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 795 transitions. [2019-12-07 18:00:29,027 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 795 transitions. Word has length 146 [2019-12-07 18:00:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:29,028 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 795 transitions. [2019-12-07 18:00:29,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 795 transitions. [2019-12-07 18:00:29,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 18:00:29,028 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:29,029 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:29,229 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 18:00:29,230 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:29,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash -789743066, now seen corresponding path program 1 times [2019-12-07 18:00:29,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:29,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1122461804] [2019-12-07 18:00:29,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 28 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:29,374 INFO L264 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:29,376 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:29,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:29,378 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:29,380 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:29,381 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:29,381 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:29,387 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:29,387 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:29,388 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:29,388 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:29,389 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:29,412 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 18:00:29,412 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 124 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 18:00:29,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1122461804] [2019-12-07 18:00:29,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:29,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:29,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517862743] [2019-12-07 18:00:29,452 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:29,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:29,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:29,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:29,453 INFO L87 Difference]: Start difference. First operand 550 states and 795 transitions. Second operand 6 states. [2019-12-07 18:00:35,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:35,554 INFO L93 Difference]: Finished difference Result 1238 states and 1793 transitions. [2019-12-07 18:00:35,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:35,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-12-07 18:00:35,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:35,557 INFO L225 Difference]: With dead ends: 1238 [2019-12-07 18:00:35,557 INFO L226 Difference]: Without dead ends: 707 [2019-12-07 18:00:35,558 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 312 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-12-07 18:00:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-12-07 18:00:35,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 583. [2019-12-07 18:00:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-12-07 18:00:35,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 837 transitions. [2019-12-07 18:00:35,568 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 837 transitions. Word has length 159 [2019-12-07 18:00:35,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:35,568 INFO L462 AbstractCegarLoop]: Abstraction has 583 states and 837 transitions. [2019-12-07 18:00:35,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:35,568 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 837 transitions. [2019-12-07 18:00:35,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-12-07 18:00:35,569 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:35,569 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:35,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 18:00:35,770 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:35,770 INFO L82 PathProgramCache]: Analyzing trace with hash -2097824324, now seen corresponding path program 1 times [2019-12-07 18:00:35,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:35,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [583805158] [2019-12-07 18:00:35,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 29 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:35,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:35,994 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:35,997 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:35,997 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:36,000 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:36,000 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:36,000 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:36,008 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:36,008 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:36,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:36,010 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:36,010 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 18:00:36,033 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:36,070 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 18:00:36,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [583805158] [2019-12-07 18:00:36,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:36,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:36,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556545829] [2019-12-07 18:00:36,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:36,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:36,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:36,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:36,071 INFO L87 Difference]: Start difference. First operand 583 states and 837 transitions. Second operand 6 states. [2019-12-07 18:00:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:41,021 INFO L93 Difference]: Finished difference Result 1264 states and 1818 transitions. [2019-12-07 18:00:41,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:41,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 160 [2019-12-07 18:00:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:41,026 INFO L225 Difference]: With dead ends: 1264 [2019-12-07 18:00:41,026 INFO L226 Difference]: Without dead ends: 682 [2019-12-07 18:00:41,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 314 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-12-07 18:00:41,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-12-07 18:00:41,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 574. [2019-12-07 18:00:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-12-07 18:00:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 817 transitions. [2019-12-07 18:00:41,036 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 817 transitions. Word has length 160 [2019-12-07 18:00:41,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:41,037 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 817 transitions. [2019-12-07 18:00:41,037 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:41,037 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 817 transitions. [2019-12-07 18:00:41,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-12-07 18:00:41,037 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:41,038 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 18:00:41,238 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 18:00:41,239 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:41,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:41,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1932441754, now seen corresponding path program 1 times [2019-12-07 18:00:41,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:41,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378924813] [2019-12-07 18:00:41,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 30 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:41,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:41,410 INFO L264 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:41,412 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:41,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:41,416 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:41,418 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:41,419 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:41,419 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:41,425 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:41,426 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:41,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:41,427 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:41,427 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:41,446 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:00:41,446 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:41,475 INFO L134 CoverageAnalysis]: Checked inductivity of 195 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:00:41,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378924813] [2019-12-07 18:00:41,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:41,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:41,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24983203] [2019-12-07 18:00:41,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:41,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:41,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:41,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:41,476 INFO L87 Difference]: Start difference. First operand 574 states and 817 transitions. Second operand 6 states. [2019-12-07 18:00:48,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:48,835 INFO L93 Difference]: Finished difference Result 1262 states and 1805 transitions. [2019-12-07 18:00:48,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:48,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-12-07 18:00:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:48,840 INFO L225 Difference]: With dead ends: 1262 [2019-12-07 18:00:48,840 INFO L226 Difference]: Without dead ends: 707 [2019-12-07 18:00:48,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 320 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-12-07 18:00:48,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-12-07 18:00:48,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 596. [2019-12-07 18:00:48,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-07 18:00:48,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 837 transitions. [2019-12-07 18:00:48,851 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 837 transitions. Word has length 163 [2019-12-07 18:00:48,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:48,851 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 837 transitions. [2019-12-07 18:00:48,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:48,851 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 837 transitions. [2019-12-07 18:00:48,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-12-07 18:00:48,852 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:48,852 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:49,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 18:00:49,053 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:49,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:49,054 INFO L82 PathProgramCache]: Analyzing trace with hash 1143329729, now seen corresponding path program 1 times [2019-12-07 18:00:49,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:49,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678574551] [2019-12-07 18:00:49,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 31 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:49,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:49,248 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:49,251 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:49,251 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:49,253 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:49,253 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:49,254 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:49,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:49,260 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:49,262 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:49,262 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:49,262 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:49,281 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:00:49,281 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:49,312 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:00:49,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678574551] [2019-12-07 18:00:49,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:49,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:49,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126575043] [2019-12-07 18:00:49,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:49,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:49,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:49,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:49,321 INFO L87 Difference]: Start difference. First operand 596 states and 837 transitions. Second operand 6 states. [2019-12-07 18:00:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:56,717 INFO L93 Difference]: Finished difference Result 1277 states and 1801 transitions. [2019-12-07 18:00:56,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:00:56,719 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-12-07 18:00:56,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:56,721 INFO L225 Difference]: With dead ends: 1277 [2019-12-07 18:00:56,721 INFO L226 Difference]: Without dead ends: 700 [2019-12-07 18:00:56,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 322 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-12-07 18:00:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-12-07 18:00:56,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 596. [2019-12-07 18:00:56,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-12-07 18:00:56,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 825 transitions. [2019-12-07 18:00:56,733 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 825 transitions. Word has length 164 [2019-12-07 18:00:56,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:56,733 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 825 transitions. [2019-12-07 18:00:56,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:00:56,733 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 825 transitions. [2019-12-07 18:00:56,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-12-07 18:00:56,734 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:56,734 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:56,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 mathsat -unsat_core_generation=3 [2019-12-07 18:00:56,935 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:56,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:56,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1529804321, now seen corresponding path program 1 times [2019-12-07 18:00:56,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:56,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1057063508] [2019-12-07 18:00:56,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 32 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:57,125 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:00:57,126 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:57,153 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 18:00:57,154 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:57,177 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-12-07 18:00:57,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1057063508] [2019-12-07 18:00:57,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:57,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 18:00:57,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935829937] [2019-12-07 18:00:57,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:00:57,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:57,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:00:57,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:00:57,179 INFO L87 Difference]: Start difference. First operand 596 states and 825 transitions. Second operand 4 states. [2019-12-07 18:00:57,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:00:57,851 INFO L93 Difference]: Finished difference Result 2275 states and 3165 transitions. [2019-12-07 18:00:57,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:00:57,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-12-07 18:00:57,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:00:57,857 INFO L225 Difference]: With dead ends: 2275 [2019-12-07 18:00:57,857 INFO L226 Difference]: Without dead ends: 1698 [2019-12-07 18:00:57,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:00:57,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-12-07 18:00:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1676. [2019-12-07 18:00:57,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1676 states. [2019-12-07 18:00:57,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1676 states to 1676 states and 2321 transitions. [2019-12-07 18:00:57,889 INFO L78 Accepts]: Start accepts. Automaton has 1676 states and 2321 transitions. Word has length 166 [2019-12-07 18:00:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:00:57,889 INFO L462 AbstractCegarLoop]: Abstraction has 1676 states and 2321 transitions. [2019-12-07 18:00:57,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:00:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 1676 states and 2321 transitions. [2019-12-07 18:00:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 18:00:57,890 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:00:57,890 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:00:58,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 mathsat -unsat_core_generation=3 [2019-12-07 18:00:58,091 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:00:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:00:58,092 INFO L82 PathProgramCache]: Analyzing trace with hash -33341689, now seen corresponding path program 1 times [2019-12-07 18:00:58,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:00:58,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169262773] [2019-12-07 18:00:58,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 33 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with mathsat -unsat_core_generation=3 [2019-12-07 18:00:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:00:58,309 INFO L264 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:00:58,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:00:58,313 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:00:58,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:58,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:58,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:58,316 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:00:58,322 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:00:58,322 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:00:58,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:00:58,323 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:00:58,323 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:00:58,343 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 18:00:58,343 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:00:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 18:00:58,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169262773] [2019-12-07 18:00:58,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:00:58,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:00:58,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228840323] [2019-12-07 18:00:58,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:00:58,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:00:58,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:00:58,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:00:58,384 INFO L87 Difference]: Start difference. First operand 1676 states and 2321 transitions. Second operand 6 states. [2019-12-07 18:01:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:05,004 INFO L93 Difference]: Finished difference Result 3703 states and 5132 transitions. [2019-12-07 18:01:05,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:01:05,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-12-07 18:01:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:05,013 INFO L225 Difference]: With dead ends: 3703 [2019-12-07 18:01:05,013 INFO L226 Difference]: Without dead ends: 2046 [2019-12-07 18:01:05,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 328 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-12-07 18:01:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2046 states. [2019-12-07 18:01:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2046 to 1748. [2019-12-07 18:01:05,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1748 states. [2019-12-07 18:01:05,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2388 transitions. [2019-12-07 18:01:05,051 INFO L78 Accepts]: Start accepts. Automaton has 1748 states and 2388 transitions. Word has length 167 [2019-12-07 18:01:05,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:05,051 INFO L462 AbstractCegarLoop]: Abstraction has 1748 states and 2388 transitions. [2019-12-07 18:01:05,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:01:05,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1748 states and 2388 transitions. [2019-12-07 18:01:05,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 18:01:05,052 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:05,053 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:05,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 mathsat -unsat_core_generation=3 [2019-12-07 18:01:05,254 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:05,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:05,255 INFO L82 PathProgramCache]: Analyzing trace with hash -907652697, now seen corresponding path program 1 times [2019-12-07 18:01:05,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:05,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19525278] [2019-12-07 18:01:05,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 34 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:05,447 INFO L264 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:01:05,448 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:05,466 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:01:05,466 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2019-12-07 18:01:05,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19525278] [2019-12-07 18:01:05,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:05,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:01:05,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3139422] [2019-12-07 18:01:05,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:01:05,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:05,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:01:05,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:01:05,482 INFO L87 Difference]: Start difference. First operand 1748 states and 2388 transitions. Second operand 3 states. [2019-12-07 18:01:05,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:05,794 INFO L93 Difference]: Finished difference Result 4005 states and 5481 transitions. [2019-12-07 18:01:05,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:01:05,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 18:01:05,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:05,801 INFO L225 Difference]: With dead ends: 4005 [2019-12-07 18:01:05,801 INFO L226 Difference]: Without dead ends: 2276 [2019-12-07 18:01:05,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:01:05,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2276 states. [2019-12-07 18:01:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2276 to 2256. [2019-12-07 18:01:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2256 states. [2019-12-07 18:01:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2256 states to 2256 states and 3080 transitions. [2019-12-07 18:01:05,859 INFO L78 Accepts]: Start accepts. Automaton has 2256 states and 3080 transitions. Word has length 167 [2019-12-07 18:01:05,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:05,859 INFO L462 AbstractCegarLoop]: Abstraction has 2256 states and 3080 transitions. [2019-12-07 18:01:05,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:01:05,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2256 states and 3080 transitions. [2019-12-07 18:01:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-12-07 18:01:05,861 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:05,861 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:06,061 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 mathsat -unsat_core_generation=3 [2019-12-07 18:01:06,062 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:06,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1172300187, now seen corresponding path program 1 times [2019-12-07 18:01:06,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:06,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679648774] [2019-12-07 18:01:06,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 35 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:06,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:06,263 INFO L264 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:01:06,264 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:06,279 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 18:01:06,279 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:06,293 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2019-12-07 18:01:06,293 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679648774] [2019-12-07 18:01:06,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:06,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 18:01:06,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914143017] [2019-12-07 18:01:06,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:01:06,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:06,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:01:06,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:01:06,294 INFO L87 Difference]: Start difference. First operand 2256 states and 3080 transitions. Second operand 3 states. [2019-12-07 18:01:06,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:06,386 INFO L93 Difference]: Finished difference Result 5067 states and 6922 transitions. [2019-12-07 18:01:06,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:01:06,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-12-07 18:01:06,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:06,395 INFO L225 Difference]: With dead ends: 5067 [2019-12-07 18:01:06,395 INFO L226 Difference]: Without dead ends: 2830 [2019-12-07 18:01:06,397 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:01:06,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2830 states. [2019-12-07 18:01:06,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2830 to 2810. [2019-12-07 18:01:06,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2019-12-07 18:01:06,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 3829 transitions. [2019-12-07 18:01:06,455 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 3829 transitions. Word has length 167 [2019-12-07 18:01:06,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:06,455 INFO L462 AbstractCegarLoop]: Abstraction has 2810 states and 3829 transitions. [2019-12-07 18:01:06,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:01:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 3829 transitions. [2019-12-07 18:01:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-12-07 18:01:06,457 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:06,457 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:06,657 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 mathsat -unsat_core_generation=3 [2019-12-07 18:01:06,658 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:06,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:06,658 INFO L82 PathProgramCache]: Analyzing trace with hash -254984256, now seen corresponding path program 1 times [2019-12-07 18:01:06,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:06,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313298788] [2019-12-07 18:01:06,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 36 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:06,827 INFO L264 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:01:06,829 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:06,831 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:01:06,832 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:06,834 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:06,834 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:06,834 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 18:01:06,841 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 18:01:06,841 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:06,842 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:06,842 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:06,842 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:5 [2019-12-07 18:01:06,863 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 18:01:06,863 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 130 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-12-07 18:01:06,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313298788] [2019-12-07 18:01:06,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:01:06,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 18:01:06,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091082571] [2019-12-07 18:01:06,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:01:06,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:06,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:01:06,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:01:06,904 INFO L87 Difference]: Start difference. First operand 2810 states and 3829 transitions. Second operand 6 states. [2019-12-07 18:01:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:01:14,120 INFO L93 Difference]: Finished difference Result 4912 states and 6700 transitions. [2019-12-07 18:01:14,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:01:14,121 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-12-07 18:01:14,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:01:14,125 INFO L225 Difference]: With dead ends: 4912 [2019-12-07 18:01:14,125 INFO L226 Difference]: Without dead ends: 2086 [2019-12-07 18:01:14,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 330 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-12-07 18:01:14,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2086 states. [2019-12-07 18:01:14,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2086 to 1805. [2019-12-07 18:01:14,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1805 states. [2019-12-07 18:01:14,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1805 states to 1805 states and 2429 transitions. [2019-12-07 18:01:14,165 INFO L78 Accepts]: Start accepts. Automaton has 1805 states and 2429 transitions. Word has length 168 [2019-12-07 18:01:14,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:01:14,166 INFO L462 AbstractCegarLoop]: Abstraction has 1805 states and 2429 transitions. [2019-12-07 18:01:14,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:01:14,166 INFO L276 IsEmpty]: Start isEmpty. Operand 1805 states and 2429 transitions. [2019-12-07 18:01:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-12-07 18:01:14,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:01:14,167 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:01:14,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 mathsat -unsat_core_generation=3 [2019-12-07 18:01:14,368 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:01:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:01:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1385917459, now seen corresponding path program 1 times [2019-12-07 18:01:14,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:01:14,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1013299020] [2019-12-07 18:01:14,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 37 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with mathsat -unsat_core_generation=3 [2019-12-07 18:01:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:01:14,702 INFO L264 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 38 conjunts are in the unsatisfiable core [2019-12-07 18:01:14,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:01:16,032 INFO L237 Elim1Store]: Index analysis took 332 ms [2019-12-07 18:01:16,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:16,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2019-12-07 18:01:16,048 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:18,877 WARN L192 SmtUtils]: Spent 2.83 s on a formula simplification that was a NOOP. DAG size: 78 [2019-12-07 18:01:18,877 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:18,880 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_343|, |v_#memory_$Pointer$.offset_344|], 2=[|v_#memory_$Pointer$.offset_340|, |v_#memory_$Pointer$.offset_341|, |v_#memory_$Pointer$.base_341|, |v_#memory_$Pointer$.base_340|]} [2019-12-07 18:01:19,038 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:19,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:19,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:19,203 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:19,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:19,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:19,652 INFO L237 Elim1Store]: Index analysis took 656 ms [2019-12-07 18:01:20,923 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 18:01:20,923 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:22,863 WARN L192 SmtUtils]: Spent 1.94 s on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 18:01:22,864 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:22,947 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:22,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:22,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:23,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:23,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:23,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:23,136 INFO L237 Elim1Store]: Index analysis took 221 ms [2019-12-07 18:01:23,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 9 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 18:01:23,343 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:24,146 WARN L192 SmtUtils]: Spent 803.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-07 18:01:24,146 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:24,159 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:24,742 WARN L192 SmtUtils]: Spent 582.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 18:01:24,742 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:24,772 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:24,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:24,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:24,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:24,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:24,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:24,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:24,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:24,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:24,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:24,838 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 13 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 46 [2019-12-07 18:01:24,839 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,133 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 18:01:25,134 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:25,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,166 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:01:25,166 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,322 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 18:01:25,322 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:25,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,337 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,338 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,339 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,340 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:01:25,340 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,393 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:25,394 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,394 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 12 variables, input treesize:181, output treesize:91 [2019-12-07 18:01:25,423 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_345|], 12=[|v_#memory_$Pointer$.base_344|]} [2019-12-07 18:01:25,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,435 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 18:01:25,436 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:25,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,494 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 18:01:25,494 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,521 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:25,521 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,521 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 18:01:25,525 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_346|], 12=[|v_#memory_$Pointer$.base_345|]} [2019-12-07 18:01:25,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,539 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 18:01:25,539 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,599 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:25,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,606 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 18:01:25,606 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,629 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:25,630 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,630 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 18:01:25,632 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_347|, |v_#memory_$Pointer$.offset_342|, |v_#memory_$Pointer$.base_342|], 12=[|v_#memory_$Pointer$.base_346|]} [2019-12-07 18:01:25,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:25,714 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 18:01:25,714 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:25,989 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 18:01:25,989 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,012 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 18:01:26,013 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,142 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-12-07 18:01:26,142 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,147 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:26,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,238 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 61 [2019-12-07 18:01:26,238 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,271 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,271 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:167, output treesize:91 [2019-12-07 18:01:26,275 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_348|], 12=[|v_#memory_$Pointer$.base_347|]} [2019-12-07 18:01:26,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,289 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 18:01:26,289 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,367 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,370 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,371 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,372 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 18:01:26,375 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,403 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,403 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,403 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 18:01:26,405 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_349|], 12=[|v_#memory_$Pointer$.base_348|]} [2019-12-07 18:01:26,416 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 18:01:26,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,480 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 52 [2019-12-07 18:01:26,487 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,512 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,512 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,512 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:129, output treesize:91 [2019-12-07 18:01:26,528 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_349|], 12=[|v_#memory_$Pointer$.offset_350|]} [2019-12-07 18:01:26,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,531 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,532 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 56 [2019-12-07 18:01:26,533 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:26,562 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,566 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2019-12-07 18:01:26,567 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,587 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,588 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:26,588 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:140, output treesize:44 [2019-12-07 18:01:26,624 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_343|], 20=[|v_#memory_$Pointer$.offset_351|]} [2019-12-07 18:01:26,629 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:26,711 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,716 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,720 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,721 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 53 [2019-12-07 18:01:26,722 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,749 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:26,750 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:82, output treesize:44 [2019-12-07 18:01:26,784 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_399|], 20=[|v_#memory_$Pointer$.offset_352|]} [2019-12-07 18:01:26,796 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 18:01:26,796 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,842 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,848 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2019-12-07 18:01:26,850 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:26,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,883 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:26,883 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:53 [2019-12-07 18:01:26,916 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_350|], 2=[|v_#memory_int_400|], 12=[|v_#memory_$Pointer$.offset_353|]} [2019-12-07 18:01:26,925 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-12-07 18:01:26,925 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:26,965 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:26,973 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:26,974 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2019-12-07 18:01:26,974 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:27,012 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:27,018 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 21 [2019-12-07 18:01:27,018 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:27,032 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,033 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,033 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:20 [2019-12-07 18:01:27,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:27,056 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:27,057 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:01:27,058 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2019-12-07 18:01:27,058 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:27,067 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,067 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,067 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:29 [2019-12-07 18:01:27,101 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-12-07 18:01:27,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:27,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,103 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:01:27,103 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:29, output treesize:3 [2019-12-07 18:01:27,329 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 146 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-12-07 18:01:27,329 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:01:27,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2019-12-07 18:01:27,368 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,372 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,372 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,372 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-12-07 18:01:27,415 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:01:27,431 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,432 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,441 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,442 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,442 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:68, output treesize:17 [2019-12-07 18:01:27,482 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_357|], 2=[|v_#memory_$Pointer$.offset_343|]} [2019-12-07 18:01:27,485 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,500 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,501 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,505 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,505 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:27 [2019-12-07 18:01:27,614 INFO L430 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_356|], 20=[|v_#memory_$Pointer$.offset_359|]} [2019-12-07 18:01:27,617 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,649 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,660 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:27,661 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:27,661 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:104, output treesize:118 [2019-12-07 18:01:29,748 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_357|], 1=[|v_#memory_$Pointer$.offset_360|]} [2019-12-07 18:01:29,751 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:29,819 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:29,821 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:29,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:29,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:29,836 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:159, output treesize:158 [2019-12-07 18:01:31,138 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_358|], 1=[|v_#memory_$Pointer$.offset_361|], 2=[|v_#memory_$Pointer$.offset_342|, |v_#memory_$Pointer$.base_342|]} [2019-12-07 18:01:31,145 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:31,325 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 18:01:31,325 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:31,329 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:31,442 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 18:01:31,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:31,445 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:31,505 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:31,507 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:31,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:31,518 INFO L534 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:31,519 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:239, output treesize:238 [2019-12-07 18:01:36,212 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_359|], 1=[|v_#memory_$Pointer$.offset_362|]} [2019-12-07 18:01:36,215 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:36,320 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 18:01:36,320 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:36,322 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:36,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:36,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 2 dim-2 vars, End of recursive call: 11 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:36,348 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:279, output treesize:278 [2019-12-07 18:01:39,180 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_360|], 1=[|v_#memory_$Pointer$.offset_363|]} [2019-12-07 18:01:39,183 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:39,312 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-12-07 18:01:39,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:39,315 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:39,344 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:01:39,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 11 dim-0 vars, 2 dim-2 vars, End of recursive call: 13 dim-0 vars, and 1 xjuncts. [2019-12-07 18:01:39,345 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 13 variables, input treesize:319, output treesize:318 [2019-12-07 18:01:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 14 proven. 185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:01:44,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1013299020] [2019-12-07 18:01:44,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:01:44,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 17 [2019-12-07 18:01:44,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120547883] [2019-12-07 18:01:44,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 18:01:44,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:01:44,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 18:01:44,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=208, Unknown=3, NotChecked=0, Total=272 [2019-12-07 18:01:44,374 INFO L87 Difference]: Start difference. First operand 1805 states and 2429 transitions. Second operand 17 states. [2019-12-07 18:03:37,997 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-12-07 18:03:58,628 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-12-07 18:05:59,814 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-12-07 18:06:44,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:44,820 INFO L93 Difference]: Finished difference Result 3696 states and 4955 transitions. [2019-12-07 18:06:44,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:06:44,821 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 170 [2019-12-07 18:06:44,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:44,824 INFO L225 Difference]: With dead ends: 3696 [2019-12-07 18:06:44,824 INFO L226 Difference]: Without dead ends: 1934 [2019-12-07 18:06:44,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 322 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 57.3s TimeCoverageRelationStatistics Valid=163, Invalid=366, Unknown=23, NotChecked=0, Total=552 [2019-12-07 18:06:44,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1934 states. [2019-12-07 18:06:44,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1934 to 1607. [2019-12-07 18:06:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-07 18:06:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 2171 transitions. [2019-12-07 18:06:44,870 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 2171 transitions. Word has length 170 [2019-12-07 18:06:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:44,871 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 2171 transitions. [2019-12-07 18:06:44,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 18:06:44,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 2171 transitions. [2019-12-07 18:06:44,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 18:06:44,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:44,872 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:06:45,072 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 mathsat -unsat_core_generation=3 [2019-12-07 18:06:45,073 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:45,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:45,073 INFO L82 PathProgramCache]: Analyzing trace with hash -759436381, now seen corresponding path program 1 times [2019-12-07 18:06:45,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:06:45,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [94053074] [2019-12-07 18:06:45,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 38 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with mathsat -unsat_core_generation=3 [2019-12-07 18:06:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:45,382 INFO L264 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 26 conjunts are in the unsatisfiable core [2019-12-07 18:06:45,385 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:45,455 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 18:06:45,456 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,619 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 18:06:45,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,620 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_366|], 2=[|v_#memory_$Pointer$.base_363|, |v_#memory_$Pointer$.base_362|]} [2019-12-07 18:06:45,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,634 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,640 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,676 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 18:06:45,676 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,779 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-12-07 18:06:45,779 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,787 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,788 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,799 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:06:45,799 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,840 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,841 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:06:45,842 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,857 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,857 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,857 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 18:06:45,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:45,866 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,872 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,872 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,872 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:06:45,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:45,876 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,882 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,882 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,882 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:06:45,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,890 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:45,890 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,903 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,906 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:45,906 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,911 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,911 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,911 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 18:06:45,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:45,916 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,920 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,921 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,921 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:06:45,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,924 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:45,924 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,930 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,930 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,930 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:06:45,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,940 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:45,940 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,952 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:45,955 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:45,955 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:45,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:45,961 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 18:06:45,963 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_413|], 2=[|v_#memory_$Pointer$.offset_365|, |v_#memory_$Pointer$.base_373|]} [2019-12-07 18:06:45,970 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2019-12-07 18:06:45,970 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:46,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:46,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 92 [2019-12-07 18:06:46,006 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:46,024 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:46,056 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:46,056 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 119 [2019-12-07 18:06:46,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:46,058 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:46,088 INFO L614 ElimStorePlain]: treesize reduction 52, result has 40.2 percent of original size [2019-12-07 18:06:46,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:46,088 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:143, output treesize:35 [2019-12-07 18:06:46,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 7 [2019-12-07 18:06:46,109 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:46,113 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:46,115 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-12-07 18:06:46,115 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:46,117 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:46,117 INFO L502 ElimStorePlain]: Eliminatee |#memory_$Pointer$.offset| vanished before elimination [2019-12-07 18:06:46,117 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:46,118 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:5 [2019-12-07 18:06:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 18:06:46,185 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:06:46,218 INFO L430 ElimStorePlain]: Different costs {1=[|#memory_int|], 2=[|v_#memory_$Pointer$.offset_370|, |v_#memory_$Pointer$.base_378|, |#memory_$Pointer$.offset|]} [2019-12-07 18:06:46,236 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 40 [2019-12-07 18:06:46,236 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-12-07 18:06:46,274 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:46,277 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 18:06:46,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:46,304 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 18:06:46,319 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:46,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 43 [2019-12-07 18:06:46,329 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:46,333 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2019-12-07 18:06:46,333 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:46,379 INFO L614 ElimStorePlain]: treesize reduction 10, result has 84.8 percent of original size [2019-12-07 18:06:46,380 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-12-07 18:06:46,380 INFO L239 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:151, output treesize:48 [2019-12-07 18:06:48,418 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2019-12-07 18:06:48,422 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,432 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:48,433 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,436 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:48,436 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,436 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2019-12-07 18:06:48,454 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,457 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:48,457 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,457 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 18:06:48,470 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,472 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:48,472 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,473 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 18:06:48,486 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:48,498 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,500 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:48,501 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,501 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:20 [2019-12-07 18:06:48,515 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,518 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:48,518 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,518 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 18:06:48,533 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,535 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:48,535 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:48,535 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:15 [2019-12-07 18:06:48,597 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2019-12-07 18:06:48,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [94053074] [2019-12-07 18:06:48,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:06:48,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-12-07 18:06:48,598 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807537081] [2019-12-07 18:06:48,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 18:06:48,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 18:06:48,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 18:06:48,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:06:48,598 INFO L87 Difference]: Start difference. First operand 1607 states and 2171 transitions. Second operand 8 states. [2019-12-07 18:06:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:06:58,330 INFO L93 Difference]: Finished difference Result 4593 states and 6228 transitions. [2019-12-07 18:06:58,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:06:58,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 192 [2019-12-07 18:06:58,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:06:58,335 INFO L225 Difference]: With dead ends: 4593 [2019-12-07 18:06:58,335 INFO L226 Difference]: Without dead ends: 3029 [2019-12-07 18:06:58,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 370 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:06:58,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2019-12-07 18:06:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 2909. [2019-12-07 18:06:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2909 states. [2019-12-07 18:06:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2909 states to 2909 states and 3981 transitions. [2019-12-07 18:06:58,421 INFO L78 Accepts]: Start accepts. Automaton has 2909 states and 3981 transitions. Word has length 192 [2019-12-07 18:06:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:06:58,422 INFO L462 AbstractCegarLoop]: Abstraction has 2909 states and 3981 transitions. [2019-12-07 18:06:58,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 18:06:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 2909 states and 3981 transitions. [2019-12-07 18:06:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 18:06:58,423 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:06:58,423 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:06:58,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 mathsat -unsat_core_generation=3 [2019-12-07 18:06:58,624 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:06:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:06:58,625 INFO L82 PathProgramCache]: Analyzing trace with hash -640994907, now seen corresponding path program 1 times [2019-12-07 18:06:58,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 18:06:58,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1852423079] [2019-12-07 18:06:58,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/mathsat Starting monitored process 39 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with mathsat -unsat_core_generation=3 [2019-12-07 18:06:59,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:06:59,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 36 conjunts are in the unsatisfiable core [2019-12-07 18:06:59,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:06:59,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-12-07 18:06:59,152 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,349 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 18:06:59,350 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,351 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_393|], 2=[|v_#memory_$Pointer$.base_387|, |v_#memory_$Pointer$.base_386|]} [2019-12-07 18:06:59,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,361 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 28 [2019-12-07 18:06:59,399 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,497 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,515 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:06:59,516 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,552 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,558 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2019-12-07 18:06:59,559 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,572 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,572 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,572 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:84, output treesize:14 [2019-12-07 18:06:59,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,581 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:59,581 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,587 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:06:59,590 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,591 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:59,591 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,596 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,596 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,596 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:06:59,598 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:59,619 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,623 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 18:06:59,623 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,631 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,631 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,632 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 18:06:59,635 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,635 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:59,636 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,641 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,641 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,641 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:06:59,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,644 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:06:59,644 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,649 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:14 [2019-12-07 18:06:59,652 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:59,673 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 18:06:59,677 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,686 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,686 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,686 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 18:06:59,688 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_380|], 2=[|v_#memory_$Pointer$.base_400|]} [2019-12-07 18:06:59,691 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 18:06:59,691 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:59,705 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,736 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,736 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 18:06:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:06:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:59,737 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-12-07 18:06:59,756 INFO L614 ElimStorePlain]: treesize reduction 52, result has 21.2 percent of original size [2019-12-07 18:06:59,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,756 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 18:06:59,758 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:59,777 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,781 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:06:59,781 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2019-12-07 18:06:59,781 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,789 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,789 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,790 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:14 [2019-12-07 18:06:59,792 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_381|], 2=[|v_#memory_$Pointer$.base_402|]} [2019-12-07 18:06:59,794 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 37 [2019-12-07 18:06:59,795 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:06:59,807 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,837 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:06:59,837 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 72 [2019-12-07 18:06:59,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:06:59,838 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,854 INFO L614 ElimStorePlain]: treesize reduction 40, result has 25.9 percent of original size [2019-12-07 18:06:59,854 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:06:59,854 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:14 [2019-12-07 18:06:59,856 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_426|, |v_#memory_$Pointer$.offset_382|], 2=[|v_#memory_$Pointer$.base_391|, |v_#memory_$Pointer$.base_403|, |v_#memory_$Pointer$.offset_378|], 6=[|v_#memory_$Pointer$.offset_379|, |v_#memory_$Pointer$.base_392|]} [2019-12-07 18:07:00,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:07:00,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:07:00,109 INFO L237 Elim1Store]: Index analysis took 113 ms [2019-12-07 18:07:00,109 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 40 [2019-12-07 18:07:00,110 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:00,733 WARN L192 SmtUtils]: Spent 623.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-12-07 18:07:00,734 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:00,801 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2019-12-07 18:07:00,802 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:01,163 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-07 18:07:01,164 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:01,170 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:07:01,522 WARN L192 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-12-07 18:07:01,522 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:01,563 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:07:01,583 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-12-07 18:07:01,583 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:01,743 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-07 18:07:01,743 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:01,749 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:07:01,933 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-12-07 18:07:01,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:01,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:07:01,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 106 [2019-12-07 18:07:01,939 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:02,001 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:02,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:07:18,263 WARN L192 SmtUtils]: Spent 16.26 s on a formula simplification that was a NOOP. DAG size: 37 [2019-12-07 18:07:18,263 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:18,263 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 168 [2019-12-07 18:07:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:18,265 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:18,331 INFO L614 ElimStorePlain]: treesize reduction 86, result has 53.0 percent of original size [2019-12-07 18:07:18,331 INFO L534 ElimStorePlain]: Start of recursive call 1: 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:07:18,331 INFO L239 ElimStorePlain]: Needed 8 recursive calls to eliminate 7 variables, input treesize:297, output treesize:55 [2019-12-07 18:07:18,361 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_404|, |v_#memory_$Pointer$.offset_383|], 12=[|v_#memory_int_427|]} [2019-12-07 18:07:18,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2019-12-07 18:07:18,364 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:07:18,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:18,399 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 31 [2019-12-07 18:07:18,399 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:07:18,427 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:18,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 18:07:18,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2019-12-07 18:07:18,431 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:18,447 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:18,448 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 18:07:18,448 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:86, output treesize:35 [2019-12-07 18:07:18,489 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2019-12-07 18:07:18,489 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:18,494 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:18,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 18:07:18,494 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:3 [2019-12-07 18:07:18,656 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 91 proven. 118 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-12-07 18:07:18,656 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 18:07:18,698 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.base_391|, |v_#memory_$Pointer$.base_406|, |v_#memory_$Pointer$.offset_385|, |v_#memory_$Pointer$.offset_378|], 3=[|#memory_int|], 6=[|v_#memory_$Pointer$.offset_379|, |v_#memory_$Pointer$.base_392|]} [2019-12-07 18:07:18,754 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2019-12-07 18:07:18,755 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:19,161 WARN L192 SmtUtils]: Spent 406.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-07 18:07:19,161 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:19,178 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:07:19,503 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-12-07 18:07:19,503 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:19,511 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:07:19,653 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-12-07 18:07:19,653 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:19,658 INFO L534 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:07:19,737 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:19,740 INFO L534 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 18:07:19,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:19,798 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 850 treesize of output 766 [2019-12-07 18:07:19,799 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 18:07:20,064 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-12-07 18:07:20,064 INFO L614 ElimStorePlain]: treesize reduction 371, result has 36.5 percent of original size [2019-12-07 18:07:20,121 INFO L343 Elim1Store]: treesize reduction 25, result has 63.2 percent of original size [2019-12-07 18:07:20,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 105 [2019-12-07 18:07:20,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:20,152 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 18:07:20,152 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 85 [2019-12-07 18:07:20,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 18:07:20,161 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 18:07:20,162 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_164], 1=[v_arrayElimCell_165]} [2019-12-07 18:07:20,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1852423079] [2019-12-07 18:07:20,175 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@79ebc17 [2019-12-07 18:07:20,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2124161729] [2019-12-07 18:07:20,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/cvc4 Starting monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 18:07:22,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:22,138 INFO L264 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 55 conjunts are in the unsatisfiable core [2019-12-07 18:07:22,139 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@79ebc17 [2019-12-07 18:07:22,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475347199] [2019-12-07 18:07:22,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c0f11647-7c8c-4763-8c90-029d87d55532/bin/uautomizer/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:07:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:07:22,407 INFO L264 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 52 conjunts are in the unsatisfiable core [2019-12-07 18:07:22,408 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@79ebc17 [2019-12-07 18:07:22,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:07:22,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 18:07:22,408 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 18:07:22,408 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:07:23,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 mathsat -unsat_core_generation=3,40 cvc4 --incremental --print-success --lang smt --rewrite-divk,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:07:23,056 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 18:07:23,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:07:23 BoogieIcfgContainer [2019-12-07 18:07:23,057 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:07:23,057 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:07:23,057 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:07:23,057 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:07:23,057 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:57:19" (3/4) ... [2019-12-07 18:07:23,060 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 18:07:23,060 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:07:23,061 INFO L168 Benchmark]: Toolchain (without parser) took 606108.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 946.9 MB in the beginning and 941.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 144.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:23,061 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:07:23,061 INFO L168 Benchmark]: CACSL2BoogieTranslator took 467.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:23,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.93 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:23,062 INFO L168 Benchmark]: Boogie Preprocessor took 55.23 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:23,062 INFO L168 Benchmark]: RCFGBuilder took 2103.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.2 MB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:23,062 INFO L168 Benchmark]: TraceAbstraction took 603417.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.1 MB). Free memory was 976.2 MB in the beginning and 941.5 MB in the end (delta: 34.6 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:07:23,063 INFO L168 Benchmark]: Witness Printer took 3.02 ms. Allocated memory is still 1.2 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:07:23,064 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 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 467.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.93 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.23 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2103.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 976.2 MB in the end (delta: 104.7 MB). Peak memory consumption was 104.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 603417.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.1 MB). Free memory was 976.2 MB in the beginning and 941.5 MB in the end (delta: 34.6 MB). Peak memory consumption was 47.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.02 ms. Allocated memory is still 1.2 GB. Free memory is still 941.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1762]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1080] BUF_MEM *buf ; [L1081] unsigned long l ; [L1082] unsigned long Time ; [L1083] unsigned long tmp ; [L1084] void (*cb)() ; [L1085] long num1 ; [L1086] int ret ; [L1087] int new_state ; [L1088] int state ; [L1089] int skip ; [L1090] int got_new_session ; [L1091] int tmp___1 = __VERIFIER_nondet_int() ; [L1092] int tmp___2 = __VERIFIER_nondet_int() ; [L1093] int tmp___3 = __VERIFIER_nondet_int() ; [L1094] int tmp___4 = __VERIFIER_nondet_int() ; [L1095] int tmp___5 = __VERIFIER_nondet_int() ; [L1096] int tmp___6 = __VERIFIER_nondet_int() ; [L1097] int tmp___7 ; [L1098] long tmp___8 = __VERIFIER_nondet_long() ; [L1099] int tmp___9 = __VERIFIER_nondet_int() ; [L1100] int tmp___10 = __VERIFIER_nondet_int() ; [L1101] int blastFlag ; [L1105] s->state = 8464 [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND TRUE (unsigned long )s->info_callback != (unsigned long )((void *)0) [L1116] EXPR s->info_callback [L1116] cb = s->info_callback [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND FALSE !(s->hit) [L1355] s->state = 8512 [L1357] s->init_num = 0 [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND TRUE s->state == 8512 [L1361] EXPR s->s3 [L1361] EXPR (s->s3)->tmp.new_cipher [L1361] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1361] COND TRUE ((s->s3)->tmp.new_cipher)->algorithms & 256UL [L1362] skip = 1 [L1376] s->state = 8528 [L1377] s->init_num = 0 [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND TRUE s->state == 8528 [L1381] EXPR s->s3 [L1381] EXPR (s->s3)->tmp.new_cipher [L1381] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1381] l = ((s->s3)->tmp.new_cipher)->algorithms [L1382] EXPR s->options [L1382] COND FALSE !(s->options & 2097152UL) [L1385] EXPR s->s3 [L1385] (s->s3)->tmp.use_rsa_tmp = 0 [L1387] EXPR s->s3 [L1387] (s->s3)->tmp.use_rsa_tmp [L1387] COND FALSE !((s->s3)->tmp.use_rsa_tmp) [L1390] COND FALSE !(l & 30UL) [L1393] COND FALSE !(l & 1UL) [L1424] skip = 1 [L1428] s->state = 8544 [L1429] s->init_num = 0 [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND TRUE s->state == 8544 [L1433] EXPR s->verify_mode [L1433] COND TRUE s->verify_mode & 1 [L1434] EXPR s->session [L1434] EXPR (s->session)->peer [L1434] COND FALSE !((unsigned long )(s->session)->peer != (unsigned long )((void *)0)) [L1444] EXPR s->s3 [L1444] EXPR (s->s3)->tmp.new_cipher [L1444] EXPR ((s->s3)->tmp.new_cipher)->algorithms [L1444] COND FALSE !(((s->s3)->tmp.new_cipher)->algorithms & 256UL) [L1454] EXPR s->s3 [L1454] (s->s3)->tmp.cert_request = 1 [L1455] ret = __VERIFIER_nondet_int() [L1456] COND FALSE !(blastFlag == 4) [L1461] COND FALSE !(ret <= 0) [L1466] s->state = 8448 [L1467] EXPR s->s3 [L1467] (s->s3)->tmp.next_state = 8576 [L1468] s->init_num = 0 [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND TRUE s->state == 8448 [L1490] COND FALSE !(num1 > 0L) [L1503] EXPR s->s3 [L1503] EXPR (s->s3)->tmp.next_state [L1503] s->state = (s->s3)->tmp.next_state [L1721] EXPR s->s3 [L1721] EXPR (s->s3)->tmp.reuse_message [L1721] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1750] skip = 0 [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state [L1223] COND TRUE s->state == 8640 [L1570] ret = __VERIFIER_nondet_int() [L1571] COND FALSE !(blastFlag == 9) [L1574] COND FALSE !(blastFlag == 12) [L1577] COND FALSE !(blastFlag == 15) [L1762] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 156 locations, 1 error locations. Result: UNKNOWN, OverallTime: 603.3s, OverallIterations: 38, TraceHistogramMax: 7, AutomataDifference: 520.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6442 SDtfs, 7597 SDslu, 17972 SDs, 0 SdLazy, 15356 SolverSat, 2355 SolverUnsat, 126 SolverUnknown, 0 SolverNotchecked, 464.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8859 GetRequests, 8624 SyntacticMatches, 16 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 60.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2909occurred in iteration=37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 37 MinimizatonAttempts, 4971 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 44.0s InterpolantComputationTime, 4431 NumberOfCodeBlocks, 4431 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 8788 ConstructedInterpolants, 205 QuantifiedInterpolants, 6777918 SizeOfPredicates, 137 NumberOfNonLiveVariables, 10683 ConjunctsInSsa, 174 ConjunctsInUnsatCore, 74 InterpolantComputations, 72 PerfectInterpolantSequences, 8527/8858 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...