./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i --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_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 d87f1110511f627d03bb602e53b3240c96adaabd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i -s /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 d87f1110511f627d03bb602e53b3240c96adaabd .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:08,073 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:22:08,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:22:08,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:22:08,081 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:22:08,082 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:22:08,083 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:22:08,084 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:22:08,085 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:22:08,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:22:08,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:22:08,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:22:08,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:22:08,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:22:08,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:22:08,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:22:08,090 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:22:08,091 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:22:08,092 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:22:08,094 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:22:08,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:22:08,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:22:08,096 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:22:08,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:22:08,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:22:08,098 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:22:08,098 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:22:08,099 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:22:08,099 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:22:08,100 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:22:08,100 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:22:08,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:22:08,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:22:08,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:22:08,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:22:08,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:22:08,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:22:08,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:22:08,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:22:08,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:22:08,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:22:08,104 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:22:08,113 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:22:08,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:22:08,114 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:22:08,114 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:22:08,115 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:22:08,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:22:08,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:22:08,115 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:22:08,115 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:22:08,115 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:22:08,115 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:22:08,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:22:08,116 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:22:08,116 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:22:08,116 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:22:08,116 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:22:08,116 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:22:08,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:22:08,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:22:08,117 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:22:08,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:22:08,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:22:08,117 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:22:08,117 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:22:08,117 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:22:08,117 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:22:08,117 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:22:08,117 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:22:08,118 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:22:08,118 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_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 -> d87f1110511f627d03bb602e53b3240c96adaabd [2019-12-07 17:22:08,215 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:22:08,225 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:22:08,228 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:22:08,230 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:22:08,230 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:22:08,230 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-12-07 17:22:08,269 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/data/95d04f7ce/adc20951765f47b2afb8874845dbbfcc/FLAGf84f73ee7 [2019-12-07 17:22:08,633 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:22:08,634 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-12-07 17:22:08,645 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/data/95d04f7ce/adc20951765f47b2afb8874845dbbfcc/FLAGf84f73ee7 [2019-12-07 17:22:08,654 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/data/95d04f7ce/adc20951765f47b2afb8874845dbbfcc [2019-12-07 17:22:08,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:22:08,657 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:22:08,658 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:22:08,658 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:22:08,660 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:22:08,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:22:08" (1/1) ... [2019-12-07 17:22:08,662 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4853e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:08, skipping insertion in model container [2019-12-07 17:22:08,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:22:08" (1/1) ... [2019-12-07 17:22:08,668 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:22:08,697 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:22:08,964 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:22:08,973 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:22:09,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:22:09,066 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:22:09,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:09 WrapperNode [2019-12-07 17:22:09,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:22:09,067 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:22:09,067 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:22:09,067 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:22:09,072 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:22:09" (1/1) ... [2019-12-07 17:22:09,088 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:22:09" (1/1) ... [2019-12-07 17:22:09,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:22:09,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:22:09,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:22:09,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:22:09,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:09" (1/1) ... [2019-12-07 17:22:09,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:09" (1/1) ... [2019-12-07 17:22:09,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:09" (1/1) ... [2019-12-07 17:22:09,124 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:09" (1/1) ... [2019-12-07 17:22:09,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:09" (1/1) ... [2019-12-07 17:22:09,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:09" (1/1) ... [2019-12-07 17:22:09,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:09" (1/1) ... [2019-12-07 17:22:09,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:22:09,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:22:09,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:22:09,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:22:09,151 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:22:09,198 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 17:22:09,198 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2019-12-07 17:22:09,198 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2019-12-07 17:22:09,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:22:09,198 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:22:09,198 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2019-12-07 17:22:09,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2019-12-07 17:22:09,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:22:09,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:22:09,199 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2019-12-07 17:22:09,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2019-12-07 17:22:09,199 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2019-12-07 17:22:09,199 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2019-12-07 17:22:09,199 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:22:09,199 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2019-12-07 17:22:09,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2019-12-07 17:22:09,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:22:09,199 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2019-12-07 17:22:09,199 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2019-12-07 17:22:09,199 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 17:22:09,199 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2019-12-07 17:22:09,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2019-12-07 17:22:09,200 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-12-07 17:22:09,200 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:22:09,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:22:09,716 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:22:09,716 INFO L287 CfgBuilder]: Removed 38 assume(true) statements. [2019-12-07 17:22:09,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:22:09 BoogieIcfgContainer [2019-12-07 17:22:09,717 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:22:09,718 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:22:09,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:22:09,720 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:22:09,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:22:08" (1/3) ... [2019-12-07 17:22:09,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0ab8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:22:09, skipping insertion in model container [2019-12-07 17:22:09,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:22:09" (2/3) ... [2019-12-07 17:22:09,721 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d0ab8a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:22:09, skipping insertion in model container [2019-12-07 17:22:09,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:22:09" (3/3) ... [2019-12-07 17:22:09,722 INFO L109 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2019-12-07 17:22:09,728 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:22:09,733 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:22:09,740 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:22:09,756 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:22:09,756 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:22:09,756 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:22:09,756 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:22:09,756 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:22:09,756 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:22:09,756 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:22:09,756 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:22:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-12-07 17:22:09,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:22:09,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:09,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:09,774 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:09,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:09,778 INFO L82 PathProgramCache]: Analyzing trace with hash 191678913, now seen corresponding path program 1 times [2019-12-07 17:22:09,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:09,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431696585] [2019-12-07 17:22:09,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:10,060 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:22:10,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431696585] [2019-12-07 17:22:10,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:10,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:22:10,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555806279] [2019-12-07 17:22:10,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:22:10,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:10,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:22:10,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:22:10,076 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 8 states. [2019-12-07 17:22:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:10,676 INFO L93 Difference]: Finished difference Result 269 states and 399 transitions. [2019-12-07 17:22:10,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:22:10,677 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-12-07 17:22:10,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:10,686 INFO L225 Difference]: With dead ends: 269 [2019-12-07 17:22:10,686 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 17:22:10,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:10,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 17:22:10,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-12-07 17:22:10,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 17:22:10,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2019-12-07 17:22:10,727 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 15 [2019-12-07 17:22:10,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:10,727 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2019-12-07 17:22:10,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:22:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2019-12-07 17:22:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:22:10,730 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:10,730 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] [2019-12-07 17:22:10,730 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:10,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:10,730 INFO L82 PathProgramCache]: Analyzing trace with hash -835354618, now seen corresponding path program 1 times [2019-12-07 17:22:10,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:10,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306545179] [2019-12-07 17:22:10,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:10,892 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:22:10,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306545179] [2019-12-07 17:22:10,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:10,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:22:10,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807279935] [2019-12-07 17:22:10,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:22:10,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:10,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:22:10,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:22:10,894 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 8 states. [2019-12-07 17:22:11,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:11,491 INFO L93 Difference]: Finished difference Result 276 states and 411 transitions. [2019-12-07 17:22:11,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:22:11,492 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-07 17:22:11,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:11,496 INFO L225 Difference]: With dead ends: 276 [2019-12-07 17:22:11,496 INFO L226 Difference]: Without dead ends: 166 [2019-12-07 17:22:11,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-12-07 17:22:11,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 154. [2019-12-07 17:22:11,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:22:11,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 214 transitions. [2019-12-07 17:22:11,513 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 214 transitions. Word has length 27 [2019-12-07 17:22:11,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:11,513 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 214 transitions. [2019-12-07 17:22:11,513 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:22:11,513 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 214 transitions. [2019-12-07 17:22:11,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:22:11,515 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:11,515 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] [2019-12-07 17:22:11,515 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:11,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:11,515 INFO L82 PathProgramCache]: Analyzing trace with hash -577189180, now seen corresponding path program 1 times [2019-12-07 17:22:11,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:11,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656413943] [2019-12-07 17:22:11,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:11,577 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:22:11,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656413943] [2019-12-07 17:22:11,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:11,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:22:11,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658248900] [2019-12-07 17:22:11,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:22:11,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:11,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:22:11,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:22:11,578 INFO L87 Difference]: Start difference. First operand 154 states and 214 transitions. Second operand 3 states. [2019-12-07 17:22:11,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:11,591 INFO L93 Difference]: Finished difference Result 296 states and 433 transitions. [2019-12-07 17:22:11,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:22:11,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 17:22:11,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:11,593 INFO L225 Difference]: With dead ends: 296 [2019-12-07 17:22:11,594 INFO L226 Difference]: Without dead ends: 156 [2019-12-07 17:22:11,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 2 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:22:11,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-12-07 17:22:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-12-07 17:22:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-12-07 17:22:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 213 transitions. [2019-12-07 17:22:11,609 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 213 transitions. Word has length 27 [2019-12-07 17:22:11,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:11,609 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 213 transitions. [2019-12-07 17:22:11,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:22:11,610 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 213 transitions. [2019-12-07 17:22:11,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:22:11,611 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:11,612 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] [2019-12-07 17:22:11,612 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:11,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:11,612 INFO L82 PathProgramCache]: Analyzing trace with hash 571761420, now seen corresponding path program 1 times [2019-12-07 17:22:11,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:11,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065420844] [2019-12-07 17:22:11,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:22:11,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065420844] [2019-12-07 17:22:11,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135824691] [2019-12-07 17:22:11,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:22:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:11,904 INFO L264 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 44 conjunts are in the unsatisfiable core [2019-12-07 17:22:11,911 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:11,956 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 11 treesize of output 7 [2019-12-07 17:22:11,956 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:11,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:11,960 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:22:11,961 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 17:22:12,006 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 17:22:12,007 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:12,022 INFO L614 ElimStorePlain]: treesize reduction 16, result has 56.8 percent of original size [2019-12-07 17:22:12,022 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:22:12,022 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-12-07 17:22:12,133 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:22:12,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:12,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2019-12-07 17:22:12,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324740890] [2019-12-07 17:22:12,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 17:22:12,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:12,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 17:22:12,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:22:12,134 INFO L87 Difference]: Start difference. First operand 154 states and 213 transitions. Second operand 19 states. [2019-12-07 17:22:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:14,856 INFO L93 Difference]: Finished difference Result 642 states and 1060 transitions. [2019-12-07 17:22:14,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-07 17:22:14,857 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-12-07 17:22:14,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:14,863 INFO L225 Difference]: With dead ends: 642 [2019-12-07 17:22:14,863 INFO L226 Difference]: Without dead ends: 502 [2019-12-07 17:22:14,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=437, Invalid=2425, Unknown=0, NotChecked=0, Total=2862 [2019-12-07 17:22:14,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-07 17:22:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 417. [2019-12-07 17:22:14,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-12-07 17:22:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 666 transitions. [2019-12-07 17:22:14,912 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 666 transitions. Word has length 28 [2019-12-07 17:22:14,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:14,912 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 666 transitions. [2019-12-07 17:22:14,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 17:22:14,912 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 666 transitions. [2019-12-07 17:22:14,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:22:14,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:14,924 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] [2019-12-07 17:22:15,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:15,125 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:15,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:15,127 INFO L82 PathProgramCache]: Analyzing trace with hash -2025119411, now seen corresponding path program 1 times [2019-12-07 17:22:15,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:15,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186665982] [2019-12-07 17:22:15,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:15,296 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:22:15,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186665982] [2019-12-07 17:22:15,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:15,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:22:15,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632651819] [2019-12-07 17:22:15,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:22:15,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:22:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:22:15,297 INFO L87 Difference]: Start difference. First operand 417 states and 666 transitions. Second operand 8 states. [2019-12-07 17:22:15,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:15,902 INFO L93 Difference]: Finished difference Result 872 states and 1561 transitions. [2019-12-07 17:22:15,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:22:15,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2019-12-07 17:22:15,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:15,906 INFO L225 Difference]: With dead ends: 872 [2019-12-07 17:22:15,906 INFO L226 Difference]: Without dead ends: 469 [2019-12-07 17:22:15,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2019-12-07 17:22:15,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 454. [2019-12-07 17:22:15,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 454 states. [2019-12-07 17:22:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 716 transitions. [2019-12-07 17:22:15,932 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 716 transitions. Word has length 29 [2019-12-07 17:22:15,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:15,932 INFO L462 AbstractCegarLoop]: Abstraction has 454 states and 716 transitions. [2019-12-07 17:22:15,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:22:15,932 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 716 transitions. [2019-12-07 17:22:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:22:15,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:15,934 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] [2019-12-07 17:22:15,934 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:15,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:15,934 INFO L82 PathProgramCache]: Analyzing trace with hash -887190847, now seen corresponding path program 1 times [2019-12-07 17:22:15,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:15,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656743430] [2019-12-07 17:22:15,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:15,976 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:22:15,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656743430] [2019-12-07 17:22:15,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:15,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:22:15,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979338546] [2019-12-07 17:22:15,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:22:15,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:15,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:22:15,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:22:15,977 INFO L87 Difference]: Start difference. First operand 454 states and 716 transitions. Second operand 7 states. [2019-12-07 17:22:16,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:16,643 INFO L93 Difference]: Finished difference Result 906 states and 1592 transitions. [2019-12-07 17:22:16,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:22:16,643 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-07 17:22:16,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:16,646 INFO L225 Difference]: With dead ends: 906 [2019-12-07 17:22:16,646 INFO L226 Difference]: Without dead ends: 466 [2019-12-07 17:22:16,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:22:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-12-07 17:22:16,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 464. [2019-12-07 17:22:16,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-12-07 17:22:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 725 transitions. [2019-12-07 17:22:16,669 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 725 transitions. Word has length 30 [2019-12-07 17:22:16,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:16,669 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 725 transitions. [2019-12-07 17:22:16,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:22:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 725 transitions. [2019-12-07 17:22:16,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:22:16,670 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:16,671 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] [2019-12-07 17:22:16,671 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:16,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:16,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1592982185, now seen corresponding path program 1 times [2019-12-07 17:22:16,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:16,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940864406] [2019-12-07 17:22:16,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:16,733 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:22:16,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940864406] [2019-12-07 17:22:16,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:16,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:22:16,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658396352] [2019-12-07 17:22:16,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:22:16,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:16,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:22:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:22:16,734 INFO L87 Difference]: Start difference. First operand 464 states and 725 transitions. Second operand 8 states. [2019-12-07 17:22:17,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:17,613 INFO L93 Difference]: Finished difference Result 918 states and 1613 transitions. [2019-12-07 17:22:17,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:22:17,613 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2019-12-07 17:22:17,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:17,617 INFO L225 Difference]: With dead ends: 918 [2019-12-07 17:22:17,617 INFO L226 Difference]: Without dead ends: 461 [2019-12-07 17:22:17,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:22:17,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-12-07 17:22:17,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 459. [2019-12-07 17:22:17,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-12-07 17:22:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 711 transitions. [2019-12-07 17:22:17,642 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 711 transitions. Word has length 31 [2019-12-07 17:22:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:17,642 INFO L462 AbstractCegarLoop]: Abstraction has 459 states and 711 transitions. [2019-12-07 17:22:17,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:22:17,642 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 711 transitions. [2019-12-07 17:22:17,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:22:17,644 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:17,644 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:22:17,644 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:17,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:17,644 INFO L82 PathProgramCache]: Analyzing trace with hash -955605667, now seen corresponding path program 1 times [2019-12-07 17:22:17,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:17,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268884330] [2019-12-07 17:22:17,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:17,737 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:22:17,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268884330] [2019-12-07 17:22:17,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282556023] [2019-12-07 17:22:17,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:22:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:17,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:22:17,813 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:17,836 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 15 treesize of output 7 [2019-12-07 17:22:17,836 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:17,840 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:17,840 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:22:17,840 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-12-07 17:22:17,843 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:22:17,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:22:17,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 12 [2019-12-07 17:22:17,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335973626] [2019-12-07 17:22:17,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:22:17,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:17,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:22:17,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:22:17,844 INFO L87 Difference]: Start difference. First operand 459 states and 711 transitions. Second operand 7 states. [2019-12-07 17:22:18,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:18,520 INFO L93 Difference]: Finished difference Result 1132 states and 2122 transitions. [2019-12-07 17:22:18,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:22:18,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-07 17:22:18,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:18,526 INFO L225 Difference]: With dead ends: 1132 [2019-12-07 17:22:18,526 INFO L226 Difference]: Without dead ends: 686 [2019-12-07 17:22:18,529 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:22:18,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-12-07 17:22:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 504. [2019-12-07 17:22:18,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-07 17:22:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 814 transitions. [2019-12-07 17:22:18,558 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 814 transitions. Word has length 41 [2019-12-07 17:22:18,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:18,558 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 814 transitions. [2019-12-07 17:22:18,558 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:22:18,558 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 814 transitions. [2019-12-07 17:22:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:22:18,559 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:18,559 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:22:18,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:18,761 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:18,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:18,761 INFO L82 PathProgramCache]: Analyzing trace with hash -794400909, now seen corresponding path program 1 times [2019-12-07 17:22:18,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:18,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689575975] [2019-12-07 17:22:18,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:18,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689575975] [2019-12-07 17:22:18,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726918166] [2019-12-07 17:22:18,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:22:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:19,022 INFO L264 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:22:19,025 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:19,042 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:19,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:22:19,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-12-07 17:22:19,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744258587] [2019-12-07 17:22:19,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:22:19,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:19,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:22:19,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:19,044 INFO L87 Difference]: Start difference. First operand 504 states and 814 transitions. Second operand 3 states. [2019-12-07 17:22:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:19,071 INFO L93 Difference]: Finished difference Result 1021 states and 1874 transitions. [2019-12-07 17:22:19,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:22:19,072 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 17:22:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:19,077 INFO L225 Difference]: With dead ends: 1021 [2019-12-07 17:22:19,077 INFO L226 Difference]: Without dead ends: 528 [2019-12-07 17:22:19,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-12-07 17:22:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 504. [2019-12-07 17:22:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 504 states. [2019-12-07 17:22:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 809 transitions. [2019-12-07 17:22:19,111 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 809 transitions. Word has length 41 [2019-12-07 17:22:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:19,111 INFO L462 AbstractCegarLoop]: Abstraction has 504 states and 809 transitions. [2019-12-07 17:22:19,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:22:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 809 transitions. [2019-12-07 17:22:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:22:19,113 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:19,113 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:22:19,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:19,314 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:19,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:19,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939229, now seen corresponding path program 1 times [2019-12-07 17:22:19,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:19,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170040913] [2019-12-07 17:22:19,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:19,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:19,489 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:19,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170040913] [2019-12-07 17:22:19,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239136869] [2019-12-07 17:22:19,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:19,562 INFO L264 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 17:22:19,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:19,626 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 15 treesize of output 7 [2019-12-07 17:22:19,627 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:19,630 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:19,630 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:22:19,631 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-12-07 17:22:19,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:22:19,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:22:19,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-12-07 17:22:19,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418790896] [2019-12-07 17:22:19,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:22:19,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:19,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:22:19,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:22:19,654 INFO L87 Difference]: Start difference. First operand 504 states and 809 transitions. Second operand 7 states. [2019-12-07 17:22:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:20,316 INFO L93 Difference]: Finished difference Result 1331 states and 2752 transitions. [2019-12-07 17:22:20,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:22:20,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-07 17:22:20,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:20,323 INFO L225 Difference]: With dead ends: 1331 [2019-12-07 17:22:20,323 INFO L226 Difference]: Without dead ends: 838 [2019-12-07 17:22:20,327 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:22:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-12-07 17:22:20,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 821. [2019-12-07 17:22:20,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2019-12-07 17:22:20,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1597 transitions. [2019-12-07 17:22:20,377 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1597 transitions. Word has length 42 [2019-12-07 17:22:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:20,378 INFO L462 AbstractCegarLoop]: Abstraction has 821 states and 1597 transitions. [2019-12-07 17:22:20,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:22:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1597 transitions. [2019-12-07 17:22:20,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:22:20,379 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:20,379 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:22:20,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:20,580 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:20,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:20,580 INFO L82 PathProgramCache]: Analyzing trace with hash -948133215, now seen corresponding path program 1 times [2019-12-07 17:22:20,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:20,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623518813] [2019-12-07 17:22:20,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:20,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:20,647 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:20,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623518813] [2019-12-07 17:22:20,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:20,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:22:20,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886608262] [2019-12-07 17:22:20,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:22:20,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:20,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:22:20,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:22:20,662 INFO L87 Difference]: Start difference. First operand 821 states and 1597 transitions. Second operand 6 states. [2019-12-07 17:22:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:21,032 INFO L93 Difference]: Finished difference Result 1841 states and 4328 transitions. [2019-12-07 17:22:21,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:22:21,033 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 17:22:21,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:21,041 INFO L225 Difference]: With dead ends: 1841 [2019-12-07 17:22:21,041 INFO L226 Difference]: Without dead ends: 1031 [2019-12-07 17:22:21,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:22:21,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1031 states. [2019-12-07 17:22:21,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1031 to 946. [2019-12-07 17:22:21,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2019-12-07 17:22:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 1807 transitions. [2019-12-07 17:22:21,096 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 1807 transitions. Word has length 42 [2019-12-07 17:22:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:21,097 INFO L462 AbstractCegarLoop]: Abstraction has 946 states and 1807 transitions. [2019-12-07 17:22:21,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:22:21,097 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 1807 transitions. [2019-12-07 17:22:21,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:22:21,098 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:21,098 INFO L410 BasicCegarLoop]: trace histogram [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 17:22:21,099 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:21,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:21,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1828765838, now seen corresponding path program 1 times [2019-12-07 17:22:21,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:21,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670688572] [2019-12-07 17:22:21,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:21,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:21,153 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:22:21,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670688572] [2019-12-07 17:22:21,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:21,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:22:21,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674552314] [2019-12-07 17:22:21,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:22:21,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:21,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:22:21,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:22:21,155 INFO L87 Difference]: Start difference. First operand 946 states and 1807 transitions. Second operand 8 states. [2019-12-07 17:22:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:21,879 INFO L93 Difference]: Finished difference Result 1942 states and 4567 transitions. [2019-12-07 17:22:21,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:22:21,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-12-07 17:22:21,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:21,886 INFO L225 Difference]: With dead ends: 1942 [2019-12-07 17:22:21,887 INFO L226 Difference]: Without dead ends: 1007 [2019-12-07 17:22:21,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:22:21,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-12-07 17:22:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 994. [2019-12-07 17:22:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 994 states. [2019-12-07 17:22:21,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 1869 transitions. [2019-12-07 17:22:21,938 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 1869 transitions. Word has length 42 [2019-12-07 17:22:21,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:21,938 INFO L462 AbstractCegarLoop]: Abstraction has 994 states and 1869 transitions. [2019-12-07 17:22:21,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:22:21,938 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 1869 transitions. [2019-12-07 17:22:21,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:22:21,939 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:21,939 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:22:21,939 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash -757221373, now seen corresponding path program 1 times [2019-12-07 17:22:21,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:21,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945076291] [2019-12-07 17:22:21,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:22,021 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:22:22,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945076291] [2019-12-07 17:22:22,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:22,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:22:22,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306227432] [2019-12-07 17:22:22,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:22:22,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:22,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:22:22,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:22:22,022 INFO L87 Difference]: Start difference. First operand 994 states and 1869 transitions. Second operand 7 states. [2019-12-07 17:22:22,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:22,884 INFO L93 Difference]: Finished difference Result 1955 states and 4552 transitions. [2019-12-07 17:22:22,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:22:22,885 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-12-07 17:22:22,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:22,894 INFO L225 Difference]: With dead ends: 1955 [2019-12-07 17:22:22,894 INFO L226 Difference]: Without dead ends: 972 [2019-12-07 17:22:22,901 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:22:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2019-12-07 17:22:22,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 965. [2019-12-07 17:22:22,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-12-07 17:22:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1828 transitions. [2019-12-07 17:22:22,941 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1828 transitions. Word has length 43 [2019-12-07 17:22:22,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:22,941 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1828 transitions. [2019-12-07 17:22:22,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:22:22,942 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1828 transitions. [2019-12-07 17:22:22,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:22:22,943 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:22,943 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 17:22:22,943 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:22,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:22,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1869230798, now seen corresponding path program 1 times [2019-12-07 17:22:22,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:22,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893011866] [2019-12-07 17:22:22,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:22,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:22,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:23,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:23,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893011866] [2019-12-07 17:22:23,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:23,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:22:23,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022306942] [2019-12-07 17:22:23,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:22:23,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:23,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:22:23,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:22:23,008 INFO L87 Difference]: Start difference. First operand 965 states and 1828 transitions. Second operand 6 states. [2019-12-07 17:22:23,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:23,581 INFO L93 Difference]: Finished difference Result 2078 states and 4938 transitions. [2019-12-07 17:22:23,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:22:23,581 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-12-07 17:22:23,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:23,589 INFO L225 Difference]: With dead ends: 2078 [2019-12-07 17:22:23,589 INFO L226 Difference]: Without dead ends: 1124 [2019-12-07 17:22:23,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:22:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1124 states. [2019-12-07 17:22:23,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1124 to 1074. [2019-12-07 17:22:23,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1074 states. [2019-12-07 17:22:23,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1074 states to 1074 states and 2049 transitions. [2019-12-07 17:22:23,644 INFO L78 Accepts]: Start accepts. Automaton has 1074 states and 2049 transitions. Word has length 46 [2019-12-07 17:22:23,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:23,644 INFO L462 AbstractCegarLoop]: Abstraction has 1074 states and 2049 transitions. [2019-12-07 17:22:23,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:22:23,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1074 states and 2049 transitions. [2019-12-07 17:22:23,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:22:23,645 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:23,645 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-12-07 17:22:23,646 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:23,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:23,646 INFO L82 PathProgramCache]: Analyzing trace with hash 214285764, now seen corresponding path program 1 times [2019-12-07 17:22:23,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:23,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375299166] [2019-12-07 17:22:23,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:23,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:23,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375299166] [2019-12-07 17:22:23,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:23,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:22:23,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674972947] [2019-12-07 17:22:23,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:22:23,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:23,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:22:23,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:22:23,705 INFO L87 Difference]: Start difference. First operand 1074 states and 2049 transitions. Second operand 6 states. [2019-12-07 17:22:24,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:24,278 INFO L93 Difference]: Finished difference Result 2175 states and 5137 transitions. [2019-12-07 17:22:24,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:22:24,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-07 17:22:24,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:24,286 INFO L225 Difference]: With dead ends: 2175 [2019-12-07 17:22:24,286 INFO L226 Difference]: Without dead ends: 1112 [2019-12-07 17:22:24,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:22:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2019-12-07 17:22:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1076. [2019-12-07 17:22:24,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1076 states. [2019-12-07 17:22:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1076 states to 1076 states and 2051 transitions. [2019-12-07 17:22:24,336 INFO L78 Accepts]: Start accepts. Automaton has 1076 states and 2051 transitions. Word has length 47 [2019-12-07 17:22:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:24,336 INFO L462 AbstractCegarLoop]: Abstraction has 1076 states and 2051 transitions. [2019-12-07 17:22:24,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:22:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1076 states and 2051 transitions. [2019-12-07 17:22:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 17:22:24,338 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:24,338 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-12-07 17:22:24,338 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:24,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:24,338 INFO L82 PathProgramCache]: Analyzing trace with hash 917449758, now seen corresponding path program 1 times [2019-12-07 17:22:24,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:24,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782017098] [2019-12-07 17:22:24,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:24,403 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:24,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782017098] [2019-12-07 17:22:24,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:24,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:22:24,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119840845] [2019-12-07 17:22:24,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:22:24,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:24,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:22:24,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:22:24,404 INFO L87 Difference]: Start difference. First operand 1076 states and 2051 transitions. Second operand 8 states. [2019-12-07 17:22:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:25,588 INFO L93 Difference]: Finished difference Result 2241 states and 5387 transitions. [2019-12-07 17:22:25,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:22:25,589 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2019-12-07 17:22:25,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:25,597 INFO L225 Difference]: With dead ends: 2241 [2019-12-07 17:22:25,597 INFO L226 Difference]: Without dead ends: 1176 [2019-12-07 17:22:25,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:22:25,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2019-12-07 17:22:25,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 1139. [2019-12-07 17:22:25,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1139 states. [2019-12-07 17:22:25,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1139 states to 1139 states and 2233 transitions. [2019-12-07 17:22:25,648 INFO L78 Accepts]: Start accepts. Automaton has 1139 states and 2233 transitions. Word has length 48 [2019-12-07 17:22:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:25,648 INFO L462 AbstractCegarLoop]: Abstraction has 1139 states and 2233 transitions. [2019-12-07 17:22:25,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:22:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1139 states and 2233 transitions. [2019-12-07 17:22:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:22:25,650 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:25,650 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 17:22:25,650 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:25,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:25,650 INFO L82 PathProgramCache]: Analyzing trace with hash -631761552, now seen corresponding path program 1 times [2019-12-07 17:22:25,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:25,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290847277] [2019-12-07 17:22:25,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:25,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:25,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290847277] [2019-12-07 17:22:25,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:25,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:22:25,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867400524] [2019-12-07 17:22:25,771 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:22:25,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:25,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:22:25,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:22:25,772 INFO L87 Difference]: Start difference. First operand 1139 states and 2233 transitions. Second operand 9 states. [2019-12-07 17:22:27,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:27,013 INFO L93 Difference]: Finished difference Result 2400 states and 5779 transitions. [2019-12-07 17:22:27,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:22:27,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 49 [2019-12-07 17:22:27,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:27,023 INFO L225 Difference]: With dead ends: 2400 [2019-12-07 17:22:27,023 INFO L226 Difference]: Without dead ends: 1272 [2019-12-07 17:22:27,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:22:27,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1272 states. [2019-12-07 17:22:27,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1272 to 1240. [2019-12-07 17:22:27,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1240 states. [2019-12-07 17:22:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 2446 transitions. [2019-12-07 17:22:27,078 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 2446 transitions. Word has length 49 [2019-12-07 17:22:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:27,079 INFO L462 AbstractCegarLoop]: Abstraction has 1240 states and 2446 transitions. [2019-12-07 17:22:27,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:22:27,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 2446 transitions. [2019-12-07 17:22:27,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:22:27,081 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:27,081 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:27,081 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:27,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:27,081 INFO L82 PathProgramCache]: Analyzing trace with hash 785261792, now seen corresponding path program 1 times [2019-12-07 17:22:27,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:27,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140214614] [2019-12-07 17:22:27,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:27,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:27,223 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:22:27,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140214614] [2019-12-07 17:22:27,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203737992] [2019-12-07 17:22:27,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:27,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:22:27,330 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:27,357 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 15 treesize of output 7 [2019-12-07 17:22:27,358 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:27,359 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:27,359 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:22:27,359 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:22:27,373 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:22:27,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:27,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 5] total 14 [2019-12-07 17:22:27,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401189853] [2019-12-07 17:22:27,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:22:27,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:27,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:22:27,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:22:27,374 INFO L87 Difference]: Start difference. First operand 1240 states and 2446 transitions. Second operand 14 states. [2019-12-07 17:22:29,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:29,276 INFO L93 Difference]: Finished difference Result 2870 states and 7067 transitions. [2019-12-07 17:22:29,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:22:29,276 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2019-12-07 17:22:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:29,304 INFO L225 Difference]: With dead ends: 2870 [2019-12-07 17:22:29,304 INFO L226 Difference]: Without dead ends: 1641 [2019-12-07 17:22:29,309 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=504, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:22:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1641 states. [2019-12-07 17:22:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1641 to 1600. [2019-12-07 17:22:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-12-07 17:22:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 3237 transitions. [2019-12-07 17:22:29,371 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 3237 transitions. Word has length 53 [2019-12-07 17:22:29,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:29,372 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 3237 transitions. [2019-12-07 17:22:29,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:22:29,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 3237 transitions. [2019-12-07 17:22:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 17:22:29,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:29,374 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:29,574 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:29,575 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:29,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:29,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1327114492, now seen corresponding path program 1 times [2019-12-07 17:22:29,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:29,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325312595] [2019-12-07 17:22:29,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:29,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325312595] [2019-12-07 17:22:29,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:29,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:22:29,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286129861] [2019-12-07 17:22:29,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:22:29,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:29,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:22:29,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:22:29,640 INFO L87 Difference]: Start difference. First operand 1600 states and 3237 transitions. Second operand 8 states. [2019-12-07 17:22:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:30,230 INFO L93 Difference]: Finished difference Result 3269 states and 8107 transitions. [2019-12-07 17:22:30,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:22:30,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-12-07 17:22:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:30,242 INFO L225 Difference]: With dead ends: 3269 [2019-12-07 17:22:30,242 INFO L226 Difference]: Without dead ends: 1680 [2019-12-07 17:22:30,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:22:30,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2019-12-07 17:22:30,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1658. [2019-12-07 17:22:30,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2019-12-07 17:22:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 3310 transitions. [2019-12-07 17:22:30,319 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 3310 transitions. Word has length 56 [2019-12-07 17:22:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:30,319 INFO L462 AbstractCegarLoop]: Abstraction has 1658 states and 3310 transitions. [2019-12-07 17:22:30,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:22:30,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 3310 transitions. [2019-12-07 17:22:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:22:30,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:30,322 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:22:30,322 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:30,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:30,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1709178951, now seen corresponding path program 1 times [2019-12-07 17:22:30,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:30,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062306272] [2019-12-07 17:22:30,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:30,420 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:30,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062306272] [2019-12-07 17:22:30,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:30,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:22:30,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126452429] [2019-12-07 17:22:30,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:22:30,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:30,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:22:30,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:22:30,421 INFO L87 Difference]: Start difference. First operand 1658 states and 3310 transitions. Second operand 7 states. [2019-12-07 17:22:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:31,082 INFO L93 Difference]: Finished difference Result 3272 states and 8053 transitions. [2019-12-07 17:22:31,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:22:31,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-07 17:22:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:31,094 INFO L225 Difference]: With dead ends: 3272 [2019-12-07 17:22:31,094 INFO L226 Difference]: Without dead ends: 1625 [2019-12-07 17:22:31,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:22:31,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2019-12-07 17:22:31,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 1617. [2019-12-07 17:22:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2019-12-07 17:22:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 3253 transitions. [2019-12-07 17:22:31,164 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 3253 transitions. Word has length 57 [2019-12-07 17:22:31,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:31,164 INFO L462 AbstractCegarLoop]: Abstraction has 1617 states and 3253 transitions. [2019-12-07 17:22:31,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:22:31,164 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 3253 transitions. [2019-12-07 17:22:31,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:22:31,166 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:31,166 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:22:31,166 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:31,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:31,167 INFO L82 PathProgramCache]: Analyzing trace with hash 1385684304, now seen corresponding path program 1 times [2019-12-07 17:22:31,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:31,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871186462] [2019-12-07 17:22:31,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:31,209 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:22:31,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871186462] [2019-12-07 17:22:31,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:31,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:22:31,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827280125] [2019-12-07 17:22:31,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:22:31,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:31,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:22:31,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:22:31,210 INFO L87 Difference]: Start difference. First operand 1617 states and 3253 transitions. Second operand 4 states. [2019-12-07 17:22:31,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:31,276 INFO L93 Difference]: Finished difference Result 3233 states and 8069 transitions. [2019-12-07 17:22:31,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:22:31,276 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-07 17:22:31,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:31,307 INFO L225 Difference]: With dead ends: 3233 [2019-12-07 17:22:31,308 INFO L226 Difference]: Without dead ends: 1627 [2019-12-07 17:22:31,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:22:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2019-12-07 17:22:31,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1617. [2019-12-07 17:22:31,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1617 states. [2019-12-07 17:22:31,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1617 states to 1617 states and 3246 transitions. [2019-12-07 17:22:31,385 INFO L78 Accepts]: Start accepts. Automaton has 1617 states and 3246 transitions. Word has length 57 [2019-12-07 17:22:31,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:31,385 INFO L462 AbstractCegarLoop]: Abstraction has 1617 states and 3246 transitions. [2019-12-07 17:22:31,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:22:31,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1617 states and 3246 transitions. [2019-12-07 17:22:31,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 17:22:31,387 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:31,387 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:22:31,387 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:31,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:31,387 INFO L82 PathProgramCache]: Analyzing trace with hash 33936865, now seen corresponding path program 1 times [2019-12-07 17:22:31,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:31,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201234728] [2019-12-07 17:22:31,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:31,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:31,461 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 17:22:31,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201234728] [2019-12-07 17:22:31,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:31,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:22:31,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655186692] [2019-12-07 17:22:31,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:22:31,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:31,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:22:31,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:22:31,462 INFO L87 Difference]: Start difference. First operand 1617 states and 3246 transitions. Second operand 7 states. [2019-12-07 17:22:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:31,861 INFO L93 Difference]: Finished difference Result 2991 states and 6992 transitions. [2019-12-07 17:22:31,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:22:31,862 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-07 17:22:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:31,869 INFO L225 Difference]: With dead ends: 2991 [2019-12-07 17:22:31,869 INFO L226 Difference]: Without dead ends: 1385 [2019-12-07 17:22:31,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:31,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2019-12-07 17:22:31,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1368. [2019-12-07 17:22:31,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2019-12-07 17:22:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2447 transitions. [2019-12-07 17:22:31,922 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2447 transitions. Word has length 57 [2019-12-07 17:22:31,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:31,923 INFO L462 AbstractCegarLoop]: Abstraction has 1368 states and 2447 transitions. [2019-12-07 17:22:31,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:22:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2447 transitions. [2019-12-07 17:22:31,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 17:22:31,924 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:31,925 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:22:31,925 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:31,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:31,925 INFO L82 PathProgramCache]: Analyzing trace with hash 171104757, now seen corresponding path program 1 times [2019-12-07 17:22:31,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:31,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127417042] [2019-12-07 17:22:31,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:32,020 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:22:32,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127417042] [2019-12-07 17:22:32,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:32,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:22:32,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004659524] [2019-12-07 17:22:32,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:22:32,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:32,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:22:32,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:22:32,021 INFO L87 Difference]: Start difference. First operand 1368 states and 2447 transitions. Second operand 8 states. [2019-12-07 17:22:32,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:32,878 INFO L93 Difference]: Finished difference Result 3020 states and 6893 transitions. [2019-12-07 17:22:32,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:22:32,878 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-07 17:22:32,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:32,891 INFO L225 Difference]: With dead ends: 3020 [2019-12-07 17:22:32,892 INFO L226 Difference]: Without dead ends: 1663 [2019-12-07 17:22:32,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:22:32,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2019-12-07 17:22:32,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1616. [2019-12-07 17:22:32,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1616 states. [2019-12-07 17:22:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1616 states to 1616 states and 3160 transitions. [2019-12-07 17:22:32,965 INFO L78 Accepts]: Start accepts. Automaton has 1616 states and 3160 transitions. Word has length 58 [2019-12-07 17:22:32,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:32,965 INFO L462 AbstractCegarLoop]: Abstraction has 1616 states and 3160 transitions. [2019-12-07 17:22:32,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:22:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1616 states and 3160 transitions. [2019-12-07 17:22:32,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:22:32,967 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:32,967 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:32,968 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:32,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:32,968 INFO L82 PathProgramCache]: Analyzing trace with hash 388417727, now seen corresponding path program 1 times [2019-12-07 17:22:32,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:32,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230717441] [2019-12-07 17:22:32,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:33,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-07 17:22:33,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230717441] [2019-12-07 17:22:33,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627924944] [2019-12-07 17:22:33,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:33,119 INFO L264 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:22:33,122 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:33,156 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 16 treesize of output 8 [2019-12-07 17:22:33,156 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:33,157 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:33,157 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:22:33,158 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-12-07 17:22:33,181 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:22:33,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:33,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-12-07 17:22:33,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461672350] [2019-12-07 17:22:33,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:22:33,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:33,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:22:33,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:22:33,182 INFO L87 Difference]: Start difference. First operand 1616 states and 3160 transitions. Second operand 13 states. [2019-12-07 17:22:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:35,376 INFO L93 Difference]: Finished difference Result 4182 states and 11100 transitions. [2019-12-07 17:22:35,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 17:22:35,376 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 60 [2019-12-07 17:22:35,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:35,392 INFO L225 Difference]: With dead ends: 4182 [2019-12-07 17:22:35,392 INFO L226 Difference]: Without dead ends: 2577 [2019-12-07 17:22:35,401 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=670, Unknown=0, NotChecked=0, Total=812 [2019-12-07 17:22:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2019-12-07 17:22:35,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2545. [2019-12-07 17:22:35,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2545 states. [2019-12-07 17:22:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2545 states to 2545 states and 5754 transitions. [2019-12-07 17:22:35,522 INFO L78 Accepts]: Start accepts. Automaton has 2545 states and 5754 transitions. Word has length 60 [2019-12-07 17:22:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:35,523 INFO L462 AbstractCegarLoop]: Abstraction has 2545 states and 5754 transitions. [2019-12-07 17:22:35,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:22:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2545 states and 5754 transitions. [2019-12-07 17:22:35,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-07 17:22:35,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:35,528 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:35,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:35,729 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:35,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:35,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1315891064, now seen corresponding path program 1 times [2019-12-07 17:22:35,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:35,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461214589] [2019-12-07 17:22:35,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:35,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 17:22:35,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461214589] [2019-12-07 17:22:35,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968359421] [2019-12-07 17:22:35,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:35,989 INFO L264 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:22:35,991 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:36,005 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-12-07 17:22:36,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:22:36,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-12-07 17:22:36,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814243359] [2019-12-07 17:22:36,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:22:36,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:36,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:22:36,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:22:36,006 INFO L87 Difference]: Start difference. First operand 2545 states and 5754 transitions. Second operand 3 states. [2019-12-07 17:22:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:36,089 INFO L93 Difference]: Finished difference Result 5159 states and 15148 transitions. [2019-12-07 17:22:36,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:22:36,089 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-07 17:22:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:36,107 INFO L225 Difference]: With dead ends: 5159 [2019-12-07 17:22:36,107 INFO L226 Difference]: Without dead ends: 2625 [2019-12-07 17:22:36,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:22:36,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2625 states. [2019-12-07 17:22:36,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2625 to 2625. [2019-12-07 17:22:36,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2625 states. [2019-12-07 17:22:36,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2625 states to 2625 states and 6221 transitions. [2019-12-07 17:22:36,251 INFO L78 Accepts]: Start accepts. Automaton has 2625 states and 6221 transitions. Word has length 86 [2019-12-07 17:22:36,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:36,251 INFO L462 AbstractCegarLoop]: Abstraction has 2625 states and 6221 transitions. [2019-12-07 17:22:36,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:22:36,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2625 states and 6221 transitions. [2019-12-07 17:22:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-07 17:22:36,256 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:36,256 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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] [2019-12-07 17:22:36,457 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:36,457 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:36,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:36,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1396062974, now seen corresponding path program 1 times [2019-12-07 17:22:36,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:36,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748164104] [2019-12-07 17:22:36,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:36,600 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 31 proven. 8 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-12-07 17:22:36,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748164104] [2019-12-07 17:22:36,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [92307264] [2019-12-07 17:22:36,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:36,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 633 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:22:36,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:36,754 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 7 treesize of output 3 [2019-12-07 17:22:36,754 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:36,756 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:36,756 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:22:36,756 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-12-07 17:22:36,770 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 15 treesize of output 7 [2019-12-07 17:22:36,771 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:22:36,772 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:22:36,772 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:22:36,773 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:22:36,813 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-12-07 17:22:36,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:36,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-12-07 17:22:36,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280403577] [2019-12-07 17:22:36,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:22:36,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:36,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:22:36,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:22:36,814 INFO L87 Difference]: Start difference. First operand 2625 states and 6221 transitions. Second operand 14 states. [2019-12-07 17:22:39,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:39,024 INFO L93 Difference]: Finished difference Result 6343 states and 20245 transitions. [2019-12-07 17:22:39,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 17:22:39,025 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 79 [2019-12-07 17:22:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:39,056 INFO L225 Difference]: With dead ends: 6343 [2019-12-07 17:22:39,057 INFO L226 Difference]: Without dead ends: 3729 [2019-12-07 17:22:39,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 80 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:22:39,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3729 states. [2019-12-07 17:22:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3729 to 3686. [2019-12-07 17:22:39,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3686 states. [2019-12-07 17:22:39,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 9580 transitions. [2019-12-07 17:22:39,278 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 9580 transitions. Word has length 79 [2019-12-07 17:22:39,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:39,278 INFO L462 AbstractCegarLoop]: Abstraction has 3686 states and 9580 transitions. [2019-12-07 17:22:39,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:22:39,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 9580 transitions. [2019-12-07 17:22:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:22:39,284 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:39,284 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 17:22:39,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:39,485 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:39,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:39,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1099686263, now seen corresponding path program 1 times [2019-12-07 17:22:39,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:39,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312439922] [2019-12-07 17:22:39,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:39,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:39,656 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 17:22:39,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312439922] [2019-12-07 17:22:39,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:39,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 17:22:39,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124498626] [2019-12-07 17:22:39,656 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:22:39,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:39,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:22:39,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:22:39,657 INFO L87 Difference]: Start difference. First operand 3686 states and 9580 transitions. Second operand 10 states. [2019-12-07 17:22:40,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:40,873 INFO L93 Difference]: Finished difference Result 7377 states and 19229 transitions. [2019-12-07 17:22:40,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:22:40,874 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 17:22:40,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:40,903 INFO L225 Difference]: With dead ends: 7377 [2019-12-07 17:22:40,903 INFO L226 Difference]: Without dead ends: 3702 [2019-12-07 17:22:40,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:22:40,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3702 states. [2019-12-07 17:22:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3702 to 3692. [2019-12-07 17:22:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3692 states. [2019-12-07 17:22:41,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 9586 transitions. [2019-12-07 17:22:41,116 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 9586 transitions. Word has length 67 [2019-12-07 17:22:41,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:41,116 INFO L462 AbstractCegarLoop]: Abstraction has 3692 states and 9586 transitions. [2019-12-07 17:22:41,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:22:41,116 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 9586 transitions. [2019-12-07 17:22:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-12-07 17:22:41,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:41,121 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:41,121 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:41,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:41,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1353224446, now seen corresponding path program 1 times [2019-12-07 17:22:41,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:41,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635281241] [2019-12-07 17:22:41,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:41,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:41,268 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 17:22:41,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635281241] [2019-12-07 17:22:41,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:41,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:22:41,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254300267] [2019-12-07 17:22:41,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:22:41,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:41,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:22:41,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:22:41,270 INFO L87 Difference]: Start difference. First operand 3692 states and 9586 transitions. Second operand 9 states. [2019-12-07 17:22:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:42,212 INFO L93 Difference]: Finished difference Result 7382 states and 25257 transitions. [2019-12-07 17:22:42,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:22:42,213 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2019-12-07 17:22:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:42,244 INFO L225 Difference]: With dead ends: 7382 [2019-12-07 17:22:42,244 INFO L226 Difference]: Without dead ends: 3698 [2019-12-07 17:22:42,266 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:22:42,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2019-12-07 17:22:42,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3683. [2019-12-07 17:22:42,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2019-12-07 17:22:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 9576 transitions. [2019-12-07 17:22:42,489 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 9576 transitions. Word has length 120 [2019-12-07 17:22:42,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:42,489 INFO L462 AbstractCegarLoop]: Abstraction has 3683 states and 9576 transitions. [2019-12-07 17:22:42,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:22:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 9576 transitions. [2019-12-07 17:22:42,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:22:42,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:42,494 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 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, 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:22:42,494 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:42,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:42,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1563479080, now seen corresponding path program 1 times [2019-12-07 17:22:42,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:42,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080376691] [2019-12-07 17:22:42,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 17:22:42,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080376691] [2019-12-07 17:22:42,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:42,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 17:22:42,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984116229] [2019-12-07 17:22:42,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:22:42,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:42,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:22:42,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:22:42,620 INFO L87 Difference]: Start difference. First operand 3683 states and 9576 transitions. Second operand 12 states. [2019-12-07 17:22:43,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:43,669 INFO L93 Difference]: Finished difference Result 7391 states and 25267 transitions. [2019-12-07 17:22:43,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:22:43,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2019-12-07 17:22:43,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:43,699 INFO L225 Difference]: With dead ends: 7391 [2019-12-07 17:22:43,699 INFO L226 Difference]: Without dead ends: 3725 [2019-12-07 17:22:43,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:22:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3725 states. [2019-12-07 17:22:43,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3725 to 3688. [2019-12-07 17:22:43,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-12-07 17:22:43,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 9583 transitions. [2019-12-07 17:22:43,924 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 9583 transitions. Word has length 96 [2019-12-07 17:22:43,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:43,924 INFO L462 AbstractCegarLoop]: Abstraction has 3688 states and 9583 transitions. [2019-12-07 17:22:43,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:22:43,925 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 9583 transitions. [2019-12-07 17:22:43,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-07 17:22:43,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:43,929 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2019-12-07 17:22:43,930 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:43,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:43,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1887071049, now seen corresponding path program 1 times [2019-12-07 17:22:43,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:43,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540460670] [2019-12-07 17:22:43,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:43,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:43,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:22:44,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540460670] [2019-12-07 17:22:44,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:44,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:22:44,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368217347] [2019-12-07 17:22:44,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:22:44,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:44,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:22:44,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:22:44,013 INFO L87 Difference]: Start difference. First operand 3688 states and 9583 transitions. Second operand 9 states. [2019-12-07 17:22:45,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:45,246 INFO L93 Difference]: Finished difference Result 7369 states and 25247 transitions. [2019-12-07 17:22:45,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:22:45,247 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2019-12-07 17:22:45,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:45,276 INFO L225 Difference]: With dead ends: 7369 [2019-12-07 17:22:45,277 INFO L226 Difference]: Without dead ends: 3689 [2019-12-07 17:22:45,298 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:22:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3689 states. [2019-12-07 17:22:45,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3689 to 3557. [2019-12-07 17:22:45,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3557 states. [2019-12-07 17:22:45,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3557 states to 3557 states and 9420 transitions. [2019-12-07 17:22:45,492 INFO L78 Accepts]: Start accepts. Automaton has 3557 states and 9420 transitions. Word has length 68 [2019-12-07 17:22:45,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:45,492 INFO L462 AbstractCegarLoop]: Abstraction has 3557 states and 9420 transitions. [2019-12-07 17:22:45,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:22:45,493 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 9420 transitions. [2019-12-07 17:22:45,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-12-07 17:22:45,498 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:45,498 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:45,499 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:45,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:45,499 INFO L82 PathProgramCache]: Analyzing trace with hash -1386467140, now seen corresponding path program 1 times [2019-12-07 17:22:45,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:45,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957837892] [2019-12-07 17:22:45,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:45,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:45,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:45,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:22:45,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957837892] [2019-12-07 17:22:45,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [628499384] [2019-12-07 17:22:45,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:45,773 INFO L264 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:22:45,776 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:45,792 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 17:22:45,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:22:45,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-12-07 17:22:45,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655894666] [2019-12-07 17:22:45,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:22:45,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:45,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:22:45,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:45,794 INFO L87 Difference]: Start difference. First operand 3557 states and 9420 transitions. Second operand 3 states. [2019-12-07 17:22:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:45,956 INFO L93 Difference]: Finished difference Result 7205 states and 25495 transitions. [2019-12-07 17:22:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:22:45,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-12-07 17:22:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:45,981 INFO L225 Difference]: With dead ends: 7205 [2019-12-07 17:22:45,981 INFO L226 Difference]: Without dead ends: 3665 [2019-12-07 17:22:46,000 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3665 states. [2019-12-07 17:22:46,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3665 to 3665. [2019-12-07 17:22:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3665 states. [2019-12-07 17:22:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3665 states to 3665 states and 10065 transitions. [2019-12-07 17:22:46,198 INFO L78 Accepts]: Start accepts. Automaton has 3665 states and 10065 transitions. Word has length 116 [2019-12-07 17:22:46,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:46,199 INFO L462 AbstractCegarLoop]: Abstraction has 3665 states and 10065 transitions. [2019-12-07 17:22:46,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:22:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 3665 states and 10065 transitions. [2019-12-07 17:22:46,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 17:22:46,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:46,205 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 4, 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, 1, 1, 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:22:46,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:46,406 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:46,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:46,406 INFO L82 PathProgramCache]: Analyzing trace with hash -979226550, now seen corresponding path program 1 times [2019-12-07 17:22:46,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:46,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891237058] [2019-12-07 17:22:46,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:46,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:46,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:46,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:46,594 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 55 proven. 3 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 17:22:46,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891237058] [2019-12-07 17:22:46,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [638250462] [2019-12-07 17:22:46,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:46,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:46,713 INFO L264 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:22:46,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:46,779 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-12-07 17:22:46,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:22:46,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 16 [2019-12-07 17:22:46,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090710318] [2019-12-07 17:22:46,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:22:46,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:46,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:22:46,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:22:46,780 INFO L87 Difference]: Start difference. First operand 3665 states and 10065 transitions. Second operand 8 states. [2019-12-07 17:22:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:46,953 INFO L93 Difference]: Finished difference Result 7368 states and 26896 transitions. [2019-12-07 17:22:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:22:46,953 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-12-07 17:22:46,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:46,982 INFO L225 Difference]: With dead ends: 7368 [2019-12-07 17:22:46,983 INFO L226 Difference]: Without dead ends: 3720 [2019-12-07 17:22:47,005 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:22:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3720 states. [2019-12-07 17:22:47,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3720 to 3687. [2019-12-07 17:22:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3687 states. [2019-12-07 17:22:47,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3687 states to 3687 states and 10094 transitions. [2019-12-07 17:22:47,247 INFO L78 Accepts]: Start accepts. Automaton has 3687 states and 10094 transitions. Word has length 123 [2019-12-07 17:22:47,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:47,248 INFO L462 AbstractCegarLoop]: Abstraction has 3687 states and 10094 transitions. [2019-12-07 17:22:47,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:22:47,248 INFO L276 IsEmpty]: Start isEmpty. Operand 3687 states and 10094 transitions. [2019-12-07 17:22:47,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-12-07 17:22:47,253 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:47,254 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:47,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:47,454 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:47,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:47,455 INFO L82 PathProgramCache]: Analyzing trace with hash 711269312, now seen corresponding path program 1 times [2019-12-07 17:22:47,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:47,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808657587] [2019-12-07 17:22:47,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:47,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:47,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:47,620 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 45 proven. 2 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 17:22:47,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808657587] [2019-12-07 17:22:47,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955335982] [2019-12-07 17:22:47,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:47,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:47,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:22:47,760 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:47,789 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-12-07 17:22:47,789 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:47,789 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4] total 12 [2019-12-07 17:22:47,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442935686] [2019-12-07 17:22:47,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:22:47,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:47,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:22:47,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:22:47,790 INFO L87 Difference]: Start difference. First operand 3687 states and 10094 transitions. Second operand 12 states. [2019-12-07 17:22:49,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:49,036 INFO L93 Difference]: Finished difference Result 7508 states and 27313 transitions. [2019-12-07 17:22:49,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:22:49,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 110 [2019-12-07 17:22:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:49,067 INFO L225 Difference]: With dead ends: 7508 [2019-12-07 17:22:49,067 INFO L226 Difference]: Without dead ends: 3838 [2019-12-07 17:22:49,089 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:22:49,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3838 states. [2019-12-07 17:22:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3838 to 3813. [2019-12-07 17:22:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3813 states. [2019-12-07 17:22:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3813 states to 3813 states and 10523 transitions. [2019-12-07 17:22:49,306 INFO L78 Accepts]: Start accepts. Automaton has 3813 states and 10523 transitions. Word has length 110 [2019-12-07 17:22:49,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:49,306 INFO L462 AbstractCegarLoop]: Abstraction has 3813 states and 10523 transitions. [2019-12-07 17:22:49,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:22:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 3813 states and 10523 transitions. [2019-12-07 17:22:49,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-07 17:22:49,308 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:49,308 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:49,508 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:49,509 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:49,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:49,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1470987099, now seen corresponding path program 1 times [2019-12-07 17:22:49,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:49,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864322121] [2019-12-07 17:22:49,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:49,671 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-07 17:22:49,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864322121] [2019-12-07 17:22:49,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1334857937] [2019-12-07 17:22:49,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:49,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:49,766 INFO L264 TraceCheckSpWp]: Trace formula consists of 614 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 17:22:49,767 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 15 proven. 3 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 17:22:49,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:49,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-12-07 17:22:49,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075708089] [2019-12-07 17:22:49,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:22:49,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:22:49,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:49,803 INFO L87 Difference]: Start difference. First operand 3813 states and 10523 transitions. Second operand 11 states. [2019-12-07 17:22:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:50,992 INFO L93 Difference]: Finished difference Result 7631 states and 28005 transitions. [2019-12-07 17:22:50,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:22:50,992 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2019-12-07 17:22:50,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:51,023 INFO L225 Difference]: With dead ends: 7631 [2019-12-07 17:22:51,023 INFO L226 Difference]: Without dead ends: 3835 [2019-12-07 17:22:51,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:22:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3835 states. [2019-12-07 17:22:51,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3835 to 3819. [2019-12-07 17:22:51,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3819 states. [2019-12-07 17:22:51,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 10474 transitions. [2019-12-07 17:22:51,260 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 10474 transitions. Word has length 84 [2019-12-07 17:22:51,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:51,260 INFO L462 AbstractCegarLoop]: Abstraction has 3819 states and 10474 transitions. [2019-12-07 17:22:51,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:22:51,260 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 10474 transitions. [2019-12-07 17:22:51,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 17:22:51,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:51,262 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:51,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:51,462 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:51,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1889379390, now seen corresponding path program 1 times [2019-12-07 17:22:51,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:51,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398830995] [2019-12-07 17:22:51,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:51,580 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 17:22:51,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398830995] [2019-12-07 17:22:51,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:51,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:22:51,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612672955] [2019-12-07 17:22:51,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:22:51,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:51,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:22:51,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:51,581 INFO L87 Difference]: Start difference. First operand 3819 states and 10474 transitions. Second operand 11 states. [2019-12-07 17:22:52,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:52,570 INFO L93 Difference]: Finished difference Result 7648 states and 27879 transitions. [2019-12-07 17:22:52,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:22:52,571 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 88 [2019-12-07 17:22:52,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:52,603 INFO L225 Difference]: With dead ends: 7648 [2019-12-07 17:22:52,603 INFO L226 Difference]: Without dead ends: 3846 [2019-12-07 17:22:52,626 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:22:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2019-12-07 17:22:52,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3829. [2019-12-07 17:22:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3829 states. [2019-12-07 17:22:52,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3829 states to 3829 states and 10503 transitions. [2019-12-07 17:22:52,866 INFO L78 Accepts]: Start accepts. Automaton has 3829 states and 10503 transitions. Word has length 88 [2019-12-07 17:22:52,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:52,866 INFO L462 AbstractCegarLoop]: Abstraction has 3829 states and 10503 transitions. [2019-12-07 17:22:52,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:22:52,866 INFO L276 IsEmpty]: Start isEmpty. Operand 3829 states and 10503 transitions. [2019-12-07 17:22:52,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 17:22:52,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:52,869 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:22:52,869 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:52,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:52,869 INFO L82 PathProgramCache]: Analyzing trace with hash 781371604, now seen corresponding path program 1 times [2019-12-07 17:22:52,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:52,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135181116] [2019-12-07 17:22:52,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:52,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-12-07 17:22:52,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135181116] [2019-12-07 17:22:52,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:52,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 17:22:52,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238939536] [2019-12-07 17:22:52,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:22:52,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:52,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:22:52,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:22:52,973 INFO L87 Difference]: Start difference. First operand 3829 states and 10503 transitions. Second operand 11 states. [2019-12-07 17:22:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:54,013 INFO L93 Difference]: Finished difference Result 7658 states and 27908 transitions. [2019-12-07 17:22:54,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:22:54,014 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-12-07 17:22:54,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:54,046 INFO L225 Difference]: With dead ends: 7658 [2019-12-07 17:22:54,046 INFO L226 Difference]: Without dead ends: 3846 [2019-12-07 17:22:54,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:22:54,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2019-12-07 17:22:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3827. [2019-12-07 17:22:54,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3827 states. [2019-12-07 17:22:54,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3827 states to 3827 states and 10499 transitions. [2019-12-07 17:22:54,277 INFO L78 Accepts]: Start accepts. Automaton has 3827 states and 10499 transitions. Word has length 94 [2019-12-07 17:22:54,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:54,277 INFO L462 AbstractCegarLoop]: Abstraction has 3827 states and 10499 transitions. [2019-12-07 17:22:54,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:22:54,277 INFO L276 IsEmpty]: Start isEmpty. Operand 3827 states and 10499 transitions. [2019-12-07 17:22:54,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-12-07 17:22:54,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:54,282 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:54,282 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:54,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:54,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1265109535, now seen corresponding path program 1 times [2019-12-07 17:22:54,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:54,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277152845] [2019-12-07 17:22:54,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:54,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:54,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:54,453 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:22:54,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277152845] [2019-12-07 17:22:54,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:22:54,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-07 17:22:54,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010903363] [2019-12-07 17:22:54,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:22:54,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:54,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:22:54,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:22:54,454 INFO L87 Difference]: Start difference. First operand 3827 states and 10499 transitions. Second operand 15 states. [2019-12-07 17:22:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:55,680 INFO L93 Difference]: Finished difference Result 7696 states and 27967 transitions. [2019-12-07 17:22:55,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:22:55,681 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 125 [2019-12-07 17:22:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:55,713 INFO L225 Difference]: With dead ends: 7696 [2019-12-07 17:22:55,713 INFO L226 Difference]: Without dead ends: 3886 [2019-12-07 17:22:55,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:22:55,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3886 states. [2019-12-07 17:22:55,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3886 to 3879. [2019-12-07 17:22:55,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3879 states. [2019-12-07 17:22:55,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3879 states to 3879 states and 10591 transitions. [2019-12-07 17:22:55,947 INFO L78 Accepts]: Start accepts. Automaton has 3879 states and 10591 transitions. Word has length 125 [2019-12-07 17:22:55,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:55,947 INFO L462 AbstractCegarLoop]: Abstraction has 3879 states and 10591 transitions. [2019-12-07 17:22:55,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:22:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 3879 states and 10591 transitions. [2019-12-07 17:22:55,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-12-07 17:22:55,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:55,953 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 7, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:22:55,953 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:55,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:55,953 INFO L82 PathProgramCache]: Analyzing trace with hash -407056424, now seen corresponding path program 1 times [2019-12-07 17:22:55,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:55,953 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238072400] [2019-12-07 17:22:55,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:55,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,076 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 75 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2019-12-07 17:22:56,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238072400] [2019-12-07 17:22:56,076 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774223742] [2019-12-07 17:22:56,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:56,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:56,215 INFO L264 TraceCheckSpWp]: Trace formula consists of 1063 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 17:22:56,218 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:56,328 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 126 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-12-07 17:22:56,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:22:56,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [8] total 18 [2019-12-07 17:22:56,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489409711] [2019-12-07 17:22:56,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:22:56,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:56,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:22:56,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:22:56,329 INFO L87 Difference]: Start difference. First operand 3879 states and 10591 transitions. Second operand 12 states. [2019-12-07 17:22:56,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:56,546 INFO L93 Difference]: Finished difference Result 7820 states and 28383 transitions. [2019-12-07 17:22:56,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:22:56,547 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 162 [2019-12-07 17:22:56,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:56,582 INFO L225 Difference]: With dead ends: 7820 [2019-12-07 17:22:56,582 INFO L226 Difference]: Without dead ends: 3958 [2019-12-07 17:22:56,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=413, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:22:56,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3958 states. [2019-12-07 17:22:56,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3958 to 3923. [2019-12-07 17:22:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3923 states. [2019-12-07 17:22:56,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3923 states to 3923 states and 10659 transitions. [2019-12-07 17:22:56,856 INFO L78 Accepts]: Start accepts. Automaton has 3923 states and 10659 transitions. Word has length 162 [2019-12-07 17:22:56,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:56,856 INFO L462 AbstractCegarLoop]: Abstraction has 3923 states and 10659 transitions. [2019-12-07 17:22:56,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:22:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3923 states and 10659 transitions. [2019-12-07 17:22:56,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-12-07 17:22:56,862 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:56,862 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:57,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:57,062 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:57,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:57,063 INFO L82 PathProgramCache]: Analyzing trace with hash -483157365, now seen corresponding path program 1 times [2019-12-07 17:22:57,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:57,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545741549] [2019-12-07 17:22:57,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:57,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:57,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:57,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:57,213 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-12-07 17:22:57,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545741549] [2019-12-07 17:22:57,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718522932] [2019-12-07 17:22:57,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:57,339 INFO L264 TraceCheckSpWp]: Trace formula consists of 861 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 17:22:57,342 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:57,393 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 28 proven. 6 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 17:22:57,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:57,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-12-07 17:22:57,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340976779] [2019-12-07 17:22:57,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:22:57,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:57,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:22:57,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:22:57,394 INFO L87 Difference]: Start difference. First operand 3923 states and 10659 transitions. Second operand 12 states. [2019-12-07 17:22:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:22:58,585 INFO L93 Difference]: Finished difference Result 7844 states and 28315 transitions. [2019-12-07 17:22:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:22:58,586 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 123 [2019-12-07 17:22:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:22:58,621 INFO L225 Difference]: With dead ends: 7844 [2019-12-07 17:22:58,621 INFO L226 Difference]: Without dead ends: 3938 [2019-12-07 17:22:58,645 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:22:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2019-12-07 17:22:58,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3929. [2019-12-07 17:22:58,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2019-12-07 17:22:58,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 10664 transitions. [2019-12-07 17:22:58,860 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 10664 transitions. Word has length 123 [2019-12-07 17:22:58,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:22:58,860 INFO L462 AbstractCegarLoop]: Abstraction has 3929 states and 10664 transitions. [2019-12-07 17:22:58,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:22:58,860 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 10664 transitions. [2019-12-07 17:22:58,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-12-07 17:22:58,865 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:22:58,866 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:22:59,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:59,066 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:22:59,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:22:59,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1968965934, now seen corresponding path program 1 times [2019-12-07 17:22:59,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:22:59,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273017806] [2019-12-07 17:22:59,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:22:59,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 57 proven. 26 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-12-07 17:22:59,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273017806] [2019-12-07 17:22:59,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302651944] [2019-12-07 17:22:59,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:22:59,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:22:59,317 INFO L264 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 7 conjunts are in the unsatisfiable core [2019-12-07 17:22:59,319 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:22:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 40 proven. 10 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-12-07 17:22:59,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:22:59,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-12-07 17:22:59,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848436000] [2019-12-07 17:22:59,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:22:59,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:22:59,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:22:59,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:22:59,394 INFO L87 Difference]: Start difference. First operand 3929 states and 10664 transitions. Second operand 14 states. [2019-12-07 17:23:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:00,704 INFO L93 Difference]: Finished difference Result 7849 states and 28257 transitions. [2019-12-07 17:23:00,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:23:00,704 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 134 [2019-12-07 17:23:00,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:00,737 INFO L225 Difference]: With dead ends: 7849 [2019-12-07 17:23:00,737 INFO L226 Difference]: Without dead ends: 3928 [2019-12-07 17:23:00,760 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:23:00,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3928 states. [2019-12-07 17:23:00,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3928 to 3922. [2019-12-07 17:23:00,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-12-07 17:23:00,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 10656 transitions. [2019-12-07 17:23:00,973 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 10656 transitions. Word has length 134 [2019-12-07 17:23:00,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:00,973 INFO L462 AbstractCegarLoop]: Abstraction has 3922 states and 10656 transitions. [2019-12-07 17:23:00,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:23:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 10656 transitions. [2019-12-07 17:23:00,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-12-07 17:23:00,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:00,979 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 6, 5, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 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:23:01,179 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:01,179 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:01,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:01,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1116704741, now seen corresponding path program 1 times [2019-12-07 17:23:01,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:01,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586276958] [2019-12-07 17:23:01,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:01,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:01,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:01,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-12-07 17:23:01,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586276958] [2019-12-07 17:23:01,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:01,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 17:23:01,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864108203] [2019-12-07 17:23:01,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:23:01,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:01,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:23:01,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:23:01,462 INFO L87 Difference]: Start difference. First operand 3922 states and 10656 transitions. Second operand 18 states. [2019-12-07 17:23:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:02,866 INFO L93 Difference]: Finished difference Result 7908 states and 28339 transitions. [2019-12-07 17:23:02,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:23:02,866 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 153 [2019-12-07 17:23:02,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:02,900 INFO L225 Difference]: With dead ends: 7908 [2019-12-07 17:23:02,900 INFO L226 Difference]: Without dead ends: 4003 [2019-12-07 17:23:02,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:23:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4003 states. [2019-12-07 17:23:03,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4003 to 3983. [2019-12-07 17:23:03,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3983 states. [2019-12-07 17:23:03,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 10763 transitions. [2019-12-07 17:23:03,198 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 10763 transitions. Word has length 153 [2019-12-07 17:23:03,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:03,198 INFO L462 AbstractCegarLoop]: Abstraction has 3983 states and 10763 transitions. [2019-12-07 17:23:03,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:23:03,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 10763 transitions. [2019-12-07 17:23:03,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 17:23:03,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:03,203 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:03,203 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:03,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:03,204 INFO L82 PathProgramCache]: Analyzing trace with hash 768510409, now seen corresponding path program 1 times [2019-12-07 17:23:03,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:03,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558597043] [2019-12-07 17:23:03,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 78 proven. 14 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-12-07 17:23:03,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558597043] [2019-12-07 17:23:03,361 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164578921] [2019-12-07 17:23:03,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:03,491 INFO L264 TraceCheckSpWp]: Trace formula consists of 1061 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:23:03,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 46 proven. 15 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2019-12-07 17:23:03,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:23:03,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-12-07 17:23:03,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475495565] [2019-12-07 17:23:03,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 17:23:03,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:03,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 17:23:03,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:23:03,582 INFO L87 Difference]: Start difference. First operand 3983 states and 10763 transitions. Second operand 17 states. [2019-12-07 17:23:05,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:05,232 INFO L93 Difference]: Finished difference Result 8585 states and 32851 transitions. [2019-12-07 17:23:05,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:23:05,232 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 175 [2019-12-07 17:23:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:05,273 INFO L225 Difference]: With dead ends: 8585 [2019-12-07 17:23:05,273 INFO L226 Difference]: Without dead ends: 4619 [2019-12-07 17:23:05,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=592, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:23:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2019-12-07 17:23:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4100. [2019-12-07 17:23:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4100 states. [2019-12-07 17:23:05,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 11400 transitions. [2019-12-07 17:23:05,555 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 11400 transitions. Word has length 175 [2019-12-07 17:23:05,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:05,556 INFO L462 AbstractCegarLoop]: Abstraction has 4100 states and 11400 transitions. [2019-12-07 17:23:05,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 17:23:05,556 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 11400 transitions. [2019-12-07 17:23:05,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 17:23:05,560 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:05,561 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:05,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:05,761 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:05,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:05,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1000543410, now seen corresponding path program 1 times [2019-12-07 17:23:05,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:05,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775503691] [2019-12-07 17:23:05,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:05,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:05,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:05,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:06,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2019-12-07 17:23:06,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775503691] [2019-12-07 17:23:06,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:06,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-07 17:23:06,046 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704576262] [2019-12-07 17:23:06,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:23:06,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:06,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:23:06,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:23:06,047 INFO L87 Difference]: Start difference. First operand 4100 states and 11400 transitions. Second operand 18 states. [2019-12-07 17:23:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:07,466 INFO L93 Difference]: Finished difference Result 8227 states and 30146 transitions. [2019-12-07 17:23:07,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:23:07,466 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 148 [2019-12-07 17:23:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:07,503 INFO L225 Difference]: With dead ends: 8227 [2019-12-07 17:23:07,503 INFO L226 Difference]: Without dead ends: 4144 [2019-12-07 17:23:07,528 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2019-12-07 17:23:07,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4144 states. [2019-12-07 17:23:07,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4144 to 4050. [2019-12-07 17:23:07,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4050 states. [2019-12-07 17:23:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 11300 transitions. [2019-12-07 17:23:07,760 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 11300 transitions. Word has length 148 [2019-12-07 17:23:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:07,760 INFO L462 AbstractCegarLoop]: Abstraction has 4050 states and 11300 transitions. [2019-12-07 17:23:07,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:23:07,760 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 11300 transitions. [2019-12-07 17:23:07,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-12-07 17:23:07,765 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:07,765 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 7, 4, 4, 4, 4, 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, 1, 1, 1] [2019-12-07 17:23:07,765 INFO L410 AbstractCegarLoop]: === Iteration 44 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:07,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:07,766 INFO L82 PathProgramCache]: Analyzing trace with hash 910249671, now seen corresponding path program 1 times [2019-12-07 17:23:07,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:07,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763645995] [2019-12-07 17:23:07,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:07,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:07,949 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 92 proven. 1 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-12-07 17:23:07,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763645995] [2019-12-07 17:23:07,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412230033] [2019-12-07 17:23:07,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:08,084 INFO L264 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:23:08,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:08,126 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 16 treesize of output 8 [2019-12-07 17:23:08,126 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:08,127 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:08,128 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:23:08,128 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-12-07 17:23:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 140 proven. 3 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2019-12-07 17:23:08,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:23:08,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-12-07 17:23:08,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186767009] [2019-12-07 17:23:08,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:23:08,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:08,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:23:08,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:23:08,161 INFO L87 Difference]: Start difference. First operand 4050 states and 11300 transitions. Second operand 16 states. [2019-12-07 17:23:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:10,515 INFO L93 Difference]: Finished difference Result 7311 states and 25336 transitions. [2019-12-07 17:23:10,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:23:10,516 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 146 [2019-12-07 17:23:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:10,541 INFO L225 Difference]: With dead ends: 7311 [2019-12-07 17:23:10,541 INFO L226 Difference]: Without dead ends: 3269 [2019-12-07 17:23:10,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 17:23:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3269 states. [2019-12-07 17:23:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3269 to 3096. [2019-12-07 17:23:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3096 states. [2019-12-07 17:23:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3096 states to 3096 states and 7479 transitions. [2019-12-07 17:23:10,771 INFO L78 Accepts]: Start accepts. Automaton has 3096 states and 7479 transitions. Word has length 146 [2019-12-07 17:23:10,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:10,772 INFO L462 AbstractCegarLoop]: Abstraction has 3096 states and 7479 transitions. [2019-12-07 17:23:10,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:23:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3096 states and 7479 transitions. [2019-12-07 17:23:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-07 17:23:10,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:10,776 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:10,976 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:10,976 INFO L410 AbstractCegarLoop]: === Iteration 45 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:10,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:10,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1836067308, now seen corresponding path program 1 times [2019-12-07 17:23:10,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:10,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805466170] [2019-12-07 17:23:10,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:11,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:11,454 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 54 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-12-07 17:23:11,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805466170] [2019-12-07 17:23:11,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460486732] [2019-12-07 17:23:11,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:11,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:11,562 INFO L264 TraceCheckSpWp]: Trace formula consists of 701 conjuncts, 31 conjunts are in the unsatisfiable core [2019-12-07 17:23:11,564 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:11,569 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 11 treesize of output 7 [2019-12-07 17:23:11,569 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:11,573 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:11,573 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:23:11,573 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 17:23:11,629 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:11,630 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 26 treesize of output 45 [2019-12-07 17:23:11,630 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:11,640 INFO L614 ElimStorePlain]: treesize reduction 24, result has 42.9 percent of original size [2019-12-07 17:23:11,640 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:23:11,640 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-12-07 17:23:11,692 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:11,693 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 22 treesize of output 18 [2019-12-07 17:23:11,693 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:11,699 INFO L614 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-12-07 17:23:11,699 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:23:11,699 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2019-12-07 17:23:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 32 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-12-07 17:23:11,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:23:11,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10] total 30 [2019-12-07 17:23:11,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426325503] [2019-12-07 17:23:11,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 17:23:11,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:11,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 17:23:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:23:11,746 INFO L87 Difference]: Start difference. First operand 3096 states and 7479 transitions. Second operand 30 states. [2019-12-07 17:23:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:21,473 INFO L93 Difference]: Finished difference Result 11495 states and 34790 transitions. [2019-12-07 17:23:21,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-07 17:23:21,473 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 96 [2019-12-07 17:23:21,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:21,530 INFO L225 Difference]: With dead ends: 11495 [2019-12-07 17:23:21,530 INFO L226 Difference]: Without dead ends: 8416 [2019-12-07 17:23:21,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 95 SyntacticMatches, 3 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2710 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=925, Invalid=8195, Unknown=0, NotChecked=0, Total=9120 [2019-12-07 17:23:21,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8416 states. [2019-12-07 17:23:21,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8416 to 8194. [2019-12-07 17:23:21,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8194 states. [2019-12-07 17:23:21,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8194 states to 8194 states and 19137 transitions. [2019-12-07 17:23:21,972 INFO L78 Accepts]: Start accepts. Automaton has 8194 states and 19137 transitions. Word has length 96 [2019-12-07 17:23:21,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:21,972 INFO L462 AbstractCegarLoop]: Abstraction has 8194 states and 19137 transitions. [2019-12-07 17:23:21,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 17:23:21,972 INFO L276 IsEmpty]: Start isEmpty. Operand 8194 states and 19137 transitions. [2019-12-07 17:23:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 17:23:21,976 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:21,977 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:22,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:22,177 INFO L410 AbstractCegarLoop]: === Iteration 46 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:22,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:22,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1495999487, now seen corresponding path program 1 times [2019-12-07 17:23:22,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:22,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46082216] [2019-12-07 17:23:22,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:22,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:22,290 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-12-07 17:23:22,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46082216] [2019-12-07 17:23:22,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:22,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:23:22,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358744664] [2019-12-07 17:23:22,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:23:22,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:22,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:23:22,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:23:22,291 INFO L87 Difference]: Start difference. First operand 8194 states and 19137 transitions. Second operand 8 states. [2019-12-07 17:23:23,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:23,761 INFO L93 Difference]: Finished difference Result 16448 states and 50012 transitions. [2019-12-07 17:23:23,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:23:23,762 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 89 [2019-12-07 17:23:23,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:23,878 INFO L225 Difference]: With dead ends: 16448 [2019-12-07 17:23:23,878 INFO L226 Difference]: Without dead ends: 8271 [2019-12-07 17:23:23,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:23:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8271 states. [2019-12-07 17:23:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8271 to 8201. [2019-12-07 17:23:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8201 states. [2019-12-07 17:23:24,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 19113 transitions. [2019-12-07 17:23:24,312 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 19113 transitions. Word has length 89 [2019-12-07 17:23:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:24,312 INFO L462 AbstractCegarLoop]: Abstraction has 8201 states and 19113 transitions. [2019-12-07 17:23:24,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:23:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 19113 transitions. [2019-12-07 17:23:24,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-12-07 17:23:24,317 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:24,317 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:24,317 INFO L410 AbstractCegarLoop]: === Iteration 47 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:24,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:24,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1685793335, now seen corresponding path program 1 times [2019-12-07 17:23:24,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:24,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598860965] [2019-12-07 17:23:24,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:24,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:24,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 59 proven. 28 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 17:23:24,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598860965] [2019-12-07 17:23:24,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1364257698] [2019-12-07 17:23:24,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:24,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:23:24,601 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 35 proven. 21 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-12-07 17:23:24,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:23:24,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-12-07 17:23:24,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216103512] [2019-12-07 17:23:24,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 17:23:24,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:24,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 17:23:24,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:23:24,709 INFO L87 Difference]: Start difference. First operand 8201 states and 19113 transitions. Second operand 15 states. [2019-12-07 17:23:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:26,274 INFO L93 Difference]: Finished difference Result 16469 states and 50042 transitions. [2019-12-07 17:23:26,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:23:26,275 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 145 [2019-12-07 17:23:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:26,340 INFO L225 Difference]: With dead ends: 16469 [2019-12-07 17:23:26,340 INFO L226 Difference]: Without dead ends: 8285 [2019-12-07 17:23:26,379 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 152 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:23:26,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8285 states. [2019-12-07 17:23:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8285 to 8212. [2019-12-07 17:23:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8212 states. [2019-12-07 17:23:26,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8212 states to 8212 states and 19123 transitions. [2019-12-07 17:23:26,890 INFO L78 Accepts]: Start accepts. Automaton has 8212 states and 19123 transitions. Word has length 145 [2019-12-07 17:23:26,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:26,890 INFO L462 AbstractCegarLoop]: Abstraction has 8212 states and 19123 transitions. [2019-12-07 17:23:26,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 17:23:26,891 INFO L276 IsEmpty]: Start isEmpty. Operand 8212 states and 19123 transitions. [2019-12-07 17:23:26,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-12-07 17:23:26,896 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:26,896 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 9, 7, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:27,097 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:27,097 INFO L410 AbstractCegarLoop]: === Iteration 48 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:27,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:27,097 INFO L82 PathProgramCache]: Analyzing trace with hash 282329824, now seen corresponding path program 1 times [2019-12-07 17:23:27,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:27,098 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603908715] [2019-12-07 17:23:27,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:27,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 89 proven. 60 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-12-07 17:23:27,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603908715] [2019-12-07 17:23:27,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512650193] [2019-12-07 17:23:27,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:27,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:27,465 INFO L264 TraceCheckSpWp]: Trace formula consists of 1374 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:23:27,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:27,579 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 74 proven. 28 refuted. 0 times theorem prover too weak. 284 trivial. 0 not checked. [2019-12-07 17:23:27,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:23:27,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2019-12-07 17:23:27,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739840275] [2019-12-07 17:23:27,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 17:23:27,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:27,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 17:23:27,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:23:27,580 INFO L87 Difference]: Start difference. First operand 8212 states and 19123 transitions. Second operand 17 states. [2019-12-07 17:23:29,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:29,313 INFO L93 Difference]: Finished difference Result 16486 states and 49937 transitions. [2019-12-07 17:23:29,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-07 17:23:29,314 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 212 [2019-12-07 17:23:29,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:29,380 INFO L225 Difference]: With dead ends: 16486 [2019-12-07 17:23:29,380 INFO L226 Difference]: Without dead ends: 8291 [2019-12-07 17:23:29,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=333, Invalid=1227, Unknown=0, NotChecked=0, Total=1560 [2019-12-07 17:23:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8291 states. [2019-12-07 17:23:29,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8291 to 8201. [2019-12-07 17:23:29,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8201 states. [2019-12-07 17:23:29,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8201 states to 8201 states and 18983 transitions. [2019-12-07 17:23:29,941 INFO L78 Accepts]: Start accepts. Automaton has 8201 states and 18983 transitions. Word has length 212 [2019-12-07 17:23:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:29,941 INFO L462 AbstractCegarLoop]: Abstraction has 8201 states and 18983 transitions. [2019-12-07 17:23:29,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 17:23:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 8201 states and 18983 transitions. [2019-12-07 17:23:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-12-07 17:23:29,944 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:29,945 INFO L410 BasicCegarLoop]: trace histogram [8, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:30,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:30,145 INFO L410 AbstractCegarLoop]: === Iteration 49 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:30,146 INFO L82 PathProgramCache]: Analyzing trace with hash -708440351, now seen corresponding path program 1 times [2019-12-07 17:23:30,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:30,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785047073] [2019-12-07 17:23:30,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:30,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:30,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:30,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:30,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:30,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:30,354 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-12-07 17:23:30,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785047073] [2019-12-07 17:23:30,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:30,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:23:30,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015857675] [2019-12-07 17:23:30,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:23:30,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:30,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:23:30,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:23:30,355 INFO L87 Difference]: Start difference. First operand 8201 states and 18983 transitions. Second operand 14 states. [2019-12-07 17:23:31,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:31,594 INFO L93 Difference]: Finished difference Result 16672 states and 49875 transitions. [2019-12-07 17:23:31,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:23:31,594 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2019-12-07 17:23:31,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:31,664 INFO L225 Difference]: With dead ends: 16672 [2019-12-07 17:23:31,664 INFO L226 Difference]: Without dead ends: 8488 [2019-12-07 17:23:31,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:23:31,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8488 states. [2019-12-07 17:23:32,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8488 to 8326. [2019-12-07 17:23:32,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8326 states. [2019-12-07 17:23:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8326 states to 8326 states and 19291 transitions. [2019-12-07 17:23:32,135 INFO L78 Accepts]: Start accepts. Automaton has 8326 states and 19291 transitions. Word has length 131 [2019-12-07 17:23:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:32,135 INFO L462 AbstractCegarLoop]: Abstraction has 8326 states and 19291 transitions. [2019-12-07 17:23:32,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:23:32,136 INFO L276 IsEmpty]: Start isEmpty. Operand 8326 states and 19291 transitions. [2019-12-07 17:23:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-12-07 17:23:32,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:32,139 INFO L410 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:32,139 INFO L410 AbstractCegarLoop]: === Iteration 50 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:32,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:32,139 INFO L82 PathProgramCache]: Analyzing trace with hash -941737440, now seen corresponding path program 1 times [2019-12-07 17:23:32,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:32,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099277666] [2019-12-07 17:23:32,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:32,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:32,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:32,292 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 53 proven. 18 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-12-07 17:23:32,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099277666] [2019-12-07 17:23:32,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351567388] [2019-12-07 17:23:32,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:32,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:32,424 INFO L264 TraceCheckSpWp]: Trace formula consists of 993 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 17:23:32,426 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:32,533 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-12-07 17:23:32,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:23:32,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 11] total 17 [2019-12-07 17:23:32,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724481074] [2019-12-07 17:23:32,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 17:23:32,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:32,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 17:23:32,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-12-07 17:23:32,534 INFO L87 Difference]: Start difference. First operand 8326 states and 19291 transitions. Second operand 17 states. [2019-12-07 17:23:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:33,976 INFO L93 Difference]: Finished difference Result 16720 states and 50218 transitions. [2019-12-07 17:23:33,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:23:33,977 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 143 [2019-12-07 17:23:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:34,043 INFO L225 Difference]: With dead ends: 16720 [2019-12-07 17:23:34,043 INFO L226 Difference]: Without dead ends: 8411 [2019-12-07 17:23:34,080 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:23:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8411 states. [2019-12-07 17:23:34,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8411 to 8340. [2019-12-07 17:23:34,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8340 states. [2019-12-07 17:23:34,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8340 states to 8340 states and 19046 transitions. [2019-12-07 17:23:34,497 INFO L78 Accepts]: Start accepts. Automaton has 8340 states and 19046 transitions. Word has length 143 [2019-12-07 17:23:34,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:34,497 INFO L462 AbstractCegarLoop]: Abstraction has 8340 states and 19046 transitions. [2019-12-07 17:23:34,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 17:23:34,497 INFO L276 IsEmpty]: Start isEmpty. Operand 8340 states and 19046 transitions. [2019-12-07 17:23:34,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-12-07 17:23:34,500 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:34,500 INFO L410 BasicCegarLoop]: trace histogram [9, 8, 8, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:34,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:34,700 INFO L410 AbstractCegarLoop]: === Iteration 51 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:34,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1730111049, now seen corresponding path program 1 times [2019-12-07 17:23:34,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:34,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358167733] [2019-12-07 17:23:34,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:34,827 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 69 proven. 44 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-12-07 17:23:34,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358167733] [2019-12-07 17:23:34,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708551503] [2019-12-07 17:23:34,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:34,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:34,956 INFO L264 TraceCheckSpWp]: Trace formula consists of 1041 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 17:23:34,958 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 41 proven. 45 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-12-07 17:23:35,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:23:35,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12] total 18 [2019-12-07 17:23:35,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899361664] [2019-12-07 17:23:35,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:23:35,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:35,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:23:35,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:23:35,079 INFO L87 Difference]: Start difference. First operand 8340 states and 19046 transitions. Second operand 18 states. [2019-12-07 17:23:36,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:36,788 INFO L93 Difference]: Finished difference Result 16496 states and 48420 transitions. [2019-12-07 17:23:36,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-07 17:23:36,788 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 154 [2019-12-07 17:23:36,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:36,856 INFO L225 Difference]: With dead ends: 16496 [2019-12-07 17:23:36,857 INFO L226 Difference]: Without dead ends: 8173 [2019-12-07 17:23:36,896 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=461, Unknown=0, NotChecked=0, Total=600 [2019-12-07 17:23:36,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8173 states. [2019-12-07 17:23:37,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8173 to 7900. [2019-12-07 17:23:37,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-12-07 17:23:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 17122 transitions. [2019-12-07 17:23:37,373 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 17122 transitions. Word has length 154 [2019-12-07 17:23:37,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:37,373 INFO L462 AbstractCegarLoop]: Abstraction has 7900 states and 17122 transitions. [2019-12-07 17:23:37,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:23:37,374 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 17122 transitions. [2019-12-07 17:23:37,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-12-07 17:23:37,376 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:37,376 INFO L410 BasicCegarLoop]: trace histogram [10, 8, 8, 7, 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, 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:23:37,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:37,577 INFO L410 AbstractCegarLoop]: === Iteration 52 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:37,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:37,577 INFO L82 PathProgramCache]: Analyzing trace with hash -2082965028, now seen corresponding path program 1 times [2019-12-07 17:23:37,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:37,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279065977] [2019-12-07 17:23:37,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:37,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:37,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:37,800 INFO L134 CoverageAnalysis]: Checked inductivity of 208 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-12-07 17:23:37,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279065977] [2019-12-07 17:23:37,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:23:37,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 17:23:37,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800468935] [2019-12-07 17:23:37,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 17:23:37,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:37,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 17:23:37,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:23:37,801 INFO L87 Difference]: Start difference. First operand 7900 states and 17122 transitions. Second operand 14 states. [2019-12-07 17:23:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:39,061 INFO L93 Difference]: Finished difference Result 15936 states and 44145 transitions. [2019-12-07 17:23:39,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:23:39,061 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 155 [2019-12-07 17:23:39,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:39,124 INFO L225 Difference]: With dead ends: 15936 [2019-12-07 17:23:39,124 INFO L226 Difference]: Without dead ends: 8053 [2019-12-07 17:23:39,157 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:23:39,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8053 states. [2019-12-07 17:23:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8053 to 7898. [2019-12-07 17:23:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7898 states. [2019-12-07 17:23:39,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7898 states to 7898 states and 17112 transitions. [2019-12-07 17:23:39,555 INFO L78 Accepts]: Start accepts. Automaton has 7898 states and 17112 transitions. Word has length 155 [2019-12-07 17:23:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:39,555 INFO L462 AbstractCegarLoop]: Abstraction has 7898 states and 17112 transitions. [2019-12-07 17:23:39,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 17:23:39,555 INFO L276 IsEmpty]: Start isEmpty. Operand 7898 states and 17112 transitions. [2019-12-07 17:23:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-12-07 17:23:39,563 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:39,564 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:39,564 INFO L410 AbstractCegarLoop]: === Iteration 53 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:39,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:39,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1055741152, now seen corresponding path program 1 times [2019-12-07 17:23:39,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:39,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862766158] [2019-12-07 17:23:39,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:39,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:39,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:39,918 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 62 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 17:23:39,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862766158] [2019-12-07 17:23:39,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496110864] [2019-12-07 17:23:39,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:40,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:40,054 INFO L264 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 56 conjunts are in the unsatisfiable core [2019-12-07 17:23:40,056 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:40,219 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:40,219 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 17:23:40,219 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:40,232 INFO L614 ElimStorePlain]: treesize reduction 12, result has 64.7 percent of original size [2019-12-07 17:23:40,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:40,234 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 17:23:40,234 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2019-12-07 17:23:40,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:40,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:40,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:40,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:40,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:40,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:40,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:40,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:40,388 INFO L430 ElimStorePlain]: Different costs {0=[v_prenex_2], 1=[|#memory_int|]} [2019-12-07 17:23:40,390 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 15 treesize of output 7 [2019-12-07 17:23:40,390 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:40,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 16 treesize of output 8 [2019-12-07 17:23:40,393 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:40,402 INFO L614 ElimStorePlain]: treesize reduction 59, result has 3.3 percent of original size [2019-12-07 17:23:40,403 INFO L502 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2019-12-07 17:23:40,403 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:23:40,403 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:83, output treesize:2 [2019-12-07 17:23:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 77 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 17:23:40,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:23:40,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2019-12-07 17:23:40,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649660416] [2019-12-07 17:23:40,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-07 17:23:40,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:40,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-07 17:23:40,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=643, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:23:40,419 INFO L87 Difference]: Start difference. First operand 7898 states and 17112 transitions. Second operand 27 states. [2019-12-07 17:23:42,789 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-07 17:23:44,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:44,436 INFO L93 Difference]: Finished difference Result 16464 states and 44688 transitions. [2019-12-07 17:23:44,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:23:44,436 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 112 [2019-12-07 17:23:44,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:44,500 INFO L225 Difference]: With dead ends: 16464 [2019-12-07 17:23:44,500 INFO L226 Difference]: Without dead ends: 8583 [2019-12-07 17:23:44,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=1639, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 17:23:44,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8583 states. [2019-12-07 17:23:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8583 to 8425. [2019-12-07 17:23:44,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8425 states. [2019-12-07 17:23:44,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8425 states to 8425 states and 17575 transitions. [2019-12-07 17:23:44,923 INFO L78 Accepts]: Start accepts. Automaton has 8425 states and 17575 transitions. Word has length 112 [2019-12-07 17:23:44,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:44,923 INFO L462 AbstractCegarLoop]: Abstraction has 8425 states and 17575 transitions. [2019-12-07 17:23:44,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-12-07 17:23:44,923 INFO L276 IsEmpty]: Start isEmpty. Operand 8425 states and 17575 transitions. [2019-12-07 17:23:44,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 17:23:44,928 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:44,928 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:45,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:45,129 INFO L410 AbstractCegarLoop]: === Iteration 54 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:45,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:45,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1292773454, now seen corresponding path program 1 times [2019-12-07 17:23:45,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:45,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241389852] [2019-12-07 17:23:45,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 59 proven. 27 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 17:23:45,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241389852] [2019-12-07 17:23:45,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784081991] [2019-12-07 17:23:45,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:45,446 INFO L264 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 57 conjunts are in the unsatisfiable core [2019-12-07 17:23:45,449 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:45,617 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:45,617 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 17:23:45,618 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:45,630 INFO L614 ElimStorePlain]: treesize reduction 12, result has 64.7 percent of original size [2019-12-07 17:23:45,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:45,630 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 17:23:45,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:22 [2019-12-07 17:23:45,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:45,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:45,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:45,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:45,785 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_int|], 1=[v_prenex_4]} [2019-12-07 17:23:45,787 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 15 treesize of output 7 [2019-12-07 17:23:45,787 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:45,792 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:45,796 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:45,796 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 22 treesize of output 18 [2019-12-07 17:23:45,796 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:45,806 INFO L614 ElimStorePlain]: treesize reduction 4, result has 75.0 percent of original size [2019-12-07 17:23:45,806 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:23:45,807 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:38, output treesize:7 [2019-12-07 17:23:45,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 74 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-12-07 17:23:45,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:23:45,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2019-12-07 17:23:45,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045135168] [2019-12-07 17:23:45,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-12-07 17:23:45,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:45,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-12-07 17:23:45,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=804, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:23:45,871 INFO L87 Difference]: Start difference. First operand 8425 states and 17575 transitions. Second operand 30 states. [2019-12-07 17:23:50,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:23:50,444 INFO L93 Difference]: Finished difference Result 16571 states and 44603 transitions. [2019-12-07 17:23:50,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 17:23:50,444 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 111 [2019-12-07 17:23:50,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:23:50,504 INFO L225 Difference]: With dead ends: 16571 [2019-12-07 17:23:50,505 INFO L226 Difference]: Without dead ends: 8163 [2019-12-07 17:23:50,536 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=312, Invalid=2340, Unknown=0, NotChecked=0, Total=2652 [2019-12-07 17:23:50,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8163 states. [2019-12-07 17:23:50,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8163 to 8136. [2019-12-07 17:23:50,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8136 states. [2019-12-07 17:23:50,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8136 states to 8136 states and 17255 transitions. [2019-12-07 17:23:50,930 INFO L78 Accepts]: Start accepts. Automaton has 8136 states and 17255 transitions. Word has length 111 [2019-12-07 17:23:50,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:23:50,930 INFO L462 AbstractCegarLoop]: Abstraction has 8136 states and 17255 transitions. [2019-12-07 17:23:50,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-12-07 17:23:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 8136 states and 17255 transitions. [2019-12-07 17:23:50,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-12-07 17:23:50,936 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:23:50,936 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:23:51,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:51,136 INFO L410 AbstractCegarLoop]: === Iteration 55 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:23:51,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:23:51,137 INFO L82 PathProgramCache]: Analyzing trace with hash -123563945, now seen corresponding path program 1 times [2019-12-07 17:23:51,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:23:51,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856198538] [2019-12-07 17:23:51,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:23:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:51,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:51,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:51,955 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 55 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-12-07 17:23:51,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856198538] [2019-12-07 17:23:51,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015139919] [2019-12-07 17:23:51,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:23:52,085 INFO L264 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 92 conjunts are in the unsatisfiable core [2019-12-07 17:23:52,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:23:52,101 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 17:23:52,102 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 17:23:52,102 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,107 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,107 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,107 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:18 [2019-12-07 17:23:52,137 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_133|, |v_#memory_$Pointer$.base_144|], 2=[|v_#memory_$Pointer$.base_134|, |v_#memory_$Pointer$.base_133|, |v_#memory_$Pointer$.base_136|], 6=[|v_#memory_$Pointer$.base_135|]} [2019-12-07 17:23:52,143 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 49 treesize of output 37 [2019-12-07 17:23:52,143 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:23:52,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:52,255 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 24 treesize of output 9 [2019-12-07 17:23:52,255 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,285 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,289 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:23:52,319 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,321 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 17:23:52,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,347 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:23:52,369 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,439 INFO L343 Elim1Store]: treesize reduction 324, result has 19.6 percent of original size [2019-12-07 17:23:52,440 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 4 case distinctions, treesize of input 81 treesize of output 85 [2019-12-07 17:23:52,440 INFO L534 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,466 INFO L614 ElimStorePlain]: treesize reduction 44, result has 54.2 percent of original size [2019-12-07 17:23:52,467 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,467 INFO L239 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:144, output treesize:30 [2019-12-07 17:23:52,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:52,508 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,508 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 60 [2019-12-07 17:23:52,509 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,535 INFO L614 ElimStorePlain]: treesize reduction 32, result has 62.4 percent of original size [2019-12-07 17:23:52,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:52,538 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 37 treesize of output 19 [2019-12-07 17:23:52,539 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,546 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,546 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:23:52,547 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:38 [2019-12-07 17:23:52,629 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_136|], 2=[|v_#memory_$Pointer$.base_146|]} [2019-12-07 17:23:52,631 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 11 treesize of output 7 [2019-12-07 17:23:52,632 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,647 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:52,648 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 37 treesize of output 19 [2019-12-07 17:23:52,648 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,658 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,659 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 17:23:52,659 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:64, output treesize:45 [2019-12-07 17:23:52,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:52,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:52,732 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,732 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 28 treesize of output 96 [2019-12-07 17:23:52,732 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,772 INFO L614 ElimStorePlain]: treesize reduction 46, result has 53.5 percent of original size [2019-12-07 17:23:52,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:23:52,772 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:54, output treesize:53 [2019-12-07 17:23:52,838 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:52,838 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 37 treesize of output 19 [2019-12-07 17:23:52,839 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,851 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:52,854 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 19 treesize of output 18 [2019-12-07 17:23:52,854 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,866 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,867 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:23:52,867 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:52 [2019-12-07 17:23:52,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:52,944 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 57 [2019-12-07 17:23:52,944 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,957 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:52,961 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:52,962 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2019-12-07 17:23:52,962 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:52,982 INFO L614 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-12-07 17:23:52,983 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 17:23:52,983 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:47 [2019-12-07 17:23:53,030 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_138|, |v_#memory_$Pointer$.base_148|, |v_#memory_$Pointer$.base_137|, |v_#memory_$Pointer$.base_139|, |v_#memory_$Pointer$.base_140|], 6=[|v_#memory_int_139|]} [2019-12-07 17:23:53,034 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:23:53,103 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:53,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:53,119 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 36 treesize of output 18 [2019-12-07 17:23:53,119 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:53,182 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:53,185 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:23:53,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:53,230 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 17:23:53,266 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:53,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:53,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:53,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:53,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:53,312 INFO L343 Elim1Store]: treesize reduction 45, result has 58.7 percent of original size [2019-12-07 17:23:53,312 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 97 [2019-12-07 17:23:53,312 INFO L534 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-12-07 17:23:53,391 INFO L614 ElimStorePlain]: treesize reduction 34, result has 78.1 percent of original size [2019-12-07 17:23:53,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:23:53,427 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:23:53,427 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 4 case distinctions, treesize of input 50 treesize of output 137 [2019-12-07 17:23:53,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:53,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:53,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:53,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:23:53,434 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@46f81e53 [2019-12-07 17:23:53,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:23:53,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2019-12-07 17:23:53,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622084210] [2019-12-07 17:23:53,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 17:23:53,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:23:53,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 17:23:53,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=946, Unknown=0, NotChecked=0, Total=1056 [2019-12-07 17:23:53,435 INFO L87 Difference]: Start difference. First operand 8136 states and 17255 transitions. Second operand 25 states. [2019-12-07 17:23:53,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 17:23:53,635 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:23:53,636 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@46f81e53 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.assertCodeBlock(IncrementalHoareTripleChecker.java:354) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.prepareAssertionStackAndAddTransition(IncrementalHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.checkInternal(IncrementalHoareTripleChecker.java:127) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.checkInternal(ProtectiveHoareTripleChecker.java:60) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.checkInternal(EfficientHoareTripleChecker.java:62) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.checkInternal(CachingHoareTripleChecker.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton$InternalSuccessorComputationHelper.computeSuccWithSolver(AbstractInterpolantAutomaton.java:359) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.addOtherSuccessors(DeterministicInterpolantAutomaton.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:234) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1066) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:968) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:188) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:698) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-07 17:23:53,642 INFO L168 Benchmark]: Toolchain (without parser) took 104984.78 ms. Allocated memory was 1.0 GB in the beginning and 2.8 GB in the end (delta: 1.7 GB). Free memory was 935.5 MB in the beginning and 1.3 GB in the end (delta: -318.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 17:23:53,643 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:23:53,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 408.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:23:53,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:23:53,644 INFO L168 Benchmark]: Boogie Preprocessor took 38.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:23:53,644 INFO L168 Benchmark]: RCFGBuilder took 566.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 983.0 MB in the end (delta: 76.7 MB). Peak memory consumption was 76.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:23:53,644 INFO L168 Benchmark]: TraceAbstraction took 103922.40 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 983.0 MB in the beginning and 1.3 GB in the end (delta: -270.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 17:23:53,645 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 956.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 408.90 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -129.5 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.57 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 566.99 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 983.0 MB in the end (delta: 76.7 MB). Peak memory consumption was 76.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 103922.40 ms. Allocated memory was 1.1 GB in the beginning and 2.8 GB in the end (delta: 1.6 GB). Free memory was 983.0 MB in the beginning and 1.3 GB in the end (delta: -270.7 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@46f81e53 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalStateException: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@46f81e53: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.lock(ManagedScript.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 17:23:55,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:23:55,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:23:55,028 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:23:55,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:23:55,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:23:55,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:23:55,031 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:23:55,033 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:23:55,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:23:55,034 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:23:55,035 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:23:55,035 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:23:55,036 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:23:55,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:23:55,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:23:55,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:23:55,038 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:23:55,040 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:23:55,041 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:23:55,042 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:23:55,043 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:23:55,044 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:23:55,044 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:23:55,046 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:23:55,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:23:55,047 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:23:55,047 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:23:55,047 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:23:55,048 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:23:55,048 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:23:55,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:23:55,049 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:23:55,050 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:23:55,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:23:55,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:23:55,051 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:23:55,051 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:23:55,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:23:55,052 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:23:55,053 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:23:55,053 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 17:23:55,063 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:23:55,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:23:55,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:23:55,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:23:55,065 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:23:55,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:23:55,065 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:23:55,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:23:55,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:23:55,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:23:55,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:23:55,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:23:55,066 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 17:23:55,066 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 17:23:55,066 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:23:55,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:23:55,066 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:23:55,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:23:55,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:23:55,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:23:55,067 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:23:55,067 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:23:55,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:23:55,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:23:55,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:23:55,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:23:55,068 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 17:23:55,068 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 17:23:55,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:23:55,068 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:23:55,068 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 17:23:55,068 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_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 -> d87f1110511f627d03bb602e53b3240c96adaabd [2019-12-07 17:23:55,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:23:55,254 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:23:55,256 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:23:55,257 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:23:55,257 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:23:55,258 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/../../sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-12-07 17:23:55,295 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/data/c82a7c353/10af7265dd024f5488c4ab055d090716/FLAG218a623ef [2019-12-07 17:23:55,759 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:23:55,760 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/sv-benchmarks/c/recursive-with-pointer/system-with-recursion.i [2019-12-07 17:23:55,770 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/data/c82a7c353/10af7265dd024f5488c4ab055d090716/FLAG218a623ef [2019-12-07 17:23:56,278 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/data/c82a7c353/10af7265dd024f5488c4ab055d090716 [2019-12-07 17:23:56,280 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:23:56,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:23:56,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:23:56,282 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:23:56,285 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:23:56,285 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,287 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c052161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56, skipping insertion in model container [2019-12-07 17:23:56,287 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,292 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:23:56,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:23:56,595 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:23:56,607 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:23:56,656 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:23:56,713 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:23:56,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56 WrapperNode [2019-12-07 17:23:56,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:23:56,713 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:23:56,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:23:56,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:23:56,719 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:23:56" (1/1) ... [2019-12-07 17:23:56,737 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:23:56" (1/1) ... [2019-12-07 17:23:56,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:23:56,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:23:56,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:23:56,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:23:56,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,773 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,773 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56" (1/1) ... [2019-12-07 17:23:56,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:23:56,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:23:56,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:23:56,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:23:56,803 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:23:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-12-07 17:23:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 17:23:56,843 INFO L130 BoogieDeclarations]: Found specification of procedure event_precess [2019-12-07 17:23:56,844 INFO L138 BoogieDeclarations]: Found implementation of procedure event_precess [2019-12-07 17:23:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 17:23:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure ASNull [2019-12-07 17:23:56,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ASNull [2019-12-07 17:23:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 17:23:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:23:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure ASStart [2019-12-07 17:23:56,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStart [2019-12-07 17:23:56,844 INFO L130 BoogieDeclarations]: Found specification of procedure message_send [2019-12-07 17:23:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure message_send [2019-12-07 17:23:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 17:23:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure ASIdle [2019-12-07 17:23:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ASIdle [2019-12-07 17:23:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:23:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-07 17:23:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-12-07 17:23:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure system_initialize [2019-12-07 17:23:56,845 INFO L138 BoogieDeclarations]: Found implementation of procedure system_initialize [2019-12-07 17:23:56,845 INFO L130 BoogieDeclarations]: Found specification of procedure ASStop [2019-12-07 17:23:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ASStop [2019-12-07 17:23:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2019-12-07 17:23:56,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:23:56,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:24:02,010 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:24:02,010 INFO L287 CfgBuilder]: Removed 38 assume(true) statements. [2019-12-07 17:24:02,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:24:02 BoogieIcfgContainer [2019-12-07 17:24:02,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:24:02,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:24:02,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:24:02,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:24:02,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:23:56" (1/3) ... [2019-12-07 17:24:02,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b03cc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:24:02, skipping insertion in model container [2019-12-07 17:24:02,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:23:56" (2/3) ... [2019-12-07 17:24:02,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b03cc87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:24:02, skipping insertion in model container [2019-12-07 17:24:02,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:24:02" (3/3) ... [2019-12-07 17:24:02,016 INFO L109 eAbstractionObserver]: Analyzing ICFG system-with-recursion.i [2019-12-07 17:24:02,022 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:24:02,026 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 17:24:02,034 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 17:24:02,051 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:24:02,051 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:24:02,051 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:24:02,051 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:24:02,052 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:24:02,052 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:24:02,052 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:24:02,052 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:24:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-12-07 17:24:02,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:24:02,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:02,069 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:24:02,070 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:02,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:02,073 INFO L82 PathProgramCache]: Analyzing trace with hash 191678913, now seen corresponding path program 1 times [2019-12-07 17:24:02,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:24:02,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [391235785] [2019-12-07 17:24:02,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:24:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:02,215 INFO L264 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 17:24:02,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:24:02,259 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 11 treesize of output 7 [2019-12-07 17:24:02,259 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:24:02,267 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:24:02,268 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:24:02,268 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:24:02,313 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 15 treesize of output 7 [2019-12-07 17:24:02,313 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:24:02,316 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 15 treesize of output 7 [2019-12-07 17:24:02,317 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:24:02,331 INFO L614 ElimStorePlain]: treesize reduction 13, result has 31.6 percent of original size [2019-12-07 17:24:02,331 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:24:02,331 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 17:24:02,362 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:24:02,363 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:24:02,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:24:02,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:24:02,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:24:02,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:24:02,491 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:24:02,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [391235785] [2019-12-07 17:24:02,492 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:02,492 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-12-07 17:24:02,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623821239] [2019-12-07 17:24:02,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:24:02,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:24:02,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:24:02,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:24:02,507 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 13 states. [2019-12-07 17:24:53,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:53,433 INFO L93 Difference]: Finished difference Result 269 states and 399 transitions. [2019-12-07 17:24:53,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:24:53,434 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-07 17:24:53,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:53,445 INFO L225 Difference]: With dead ends: 269 [2019-12-07 17:24:53,445 INFO L226 Difference]: Without dead ends: 125 [2019-12-07 17:24:53,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:24:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-12-07 17:24:53,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2019-12-07 17:24:53,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 17:24:53,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 172 transitions. [2019-12-07 17:24:53,490 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 172 transitions. Word has length 15 [2019-12-07 17:24:53,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:53,491 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 172 transitions. [2019-12-07 17:24:53,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:24:53,491 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 172 transitions. [2019-12-07 17:24:53,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:24:53,494 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:53,494 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] [2019-12-07 17:24:53,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 17:24:53,695 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:53,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:53,696 INFO L82 PathProgramCache]: Analyzing trace with hash -835354618, now seen corresponding path program 1 times [2019-12-07 17:24:53,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:24:53,697 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1332360821] [2019-12-07 17:24:53,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:24:53,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:53,809 INFO L264 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:24:53,811 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:24:53,819 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:24:53,819 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:24:53,829 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:24:53,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1332360821] [2019-12-07 17:24:53,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:53,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:24:53,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895614551] [2019-12-07 17:24:53,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:24:53,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:24:53,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:24:53,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:24:53,832 INFO L87 Difference]: Start difference. First operand 124 states and 172 transitions. Second operand 4 states. [2019-12-07 17:24:53,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:24:53,855 INFO L93 Difference]: Finished difference Result 236 states and 346 transitions. [2019-12-07 17:24:53,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:24:53,855 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 17:24:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:24:53,857 INFO L225 Difference]: With dead ends: 236 [2019-12-07 17:24:53,857 INFO L226 Difference]: Without dead ends: 126 [2019-12-07 17:24:53,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 2 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 17:24:53,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-12-07 17:24:53,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2019-12-07 17:24:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-12-07 17:24:53,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 171 transitions. [2019-12-07 17:24:53,870 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 171 transitions. Word has length 27 [2019-12-07 17:24:53,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:24:53,871 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 171 transitions. [2019-12-07 17:24:53,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:24:53,871 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 171 transitions. [2019-12-07 17:24:53,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:24:53,872 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:24:53,872 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] [2019-12-07 17:24:54,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 17:24:54,074 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:24:54,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:24:54,074 INFO L82 PathProgramCache]: Analyzing trace with hash 313595982, now seen corresponding path program 1 times [2019-12-07 17:24:54,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:24:54,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328167527] [2019-12-07 17:24:54,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:24:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:24:54,231 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 17:24:54,233 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:24:54,239 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 11 treesize of output 7 [2019-12-07 17:24:54,239 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:24:54,242 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:24:54,242 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:24:54,242 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:24:54,292 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 15 treesize of output 7 [2019-12-07 17:24:54,292 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:24:54,295 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 15 treesize of output 7 [2019-12-07 17:24:54,295 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:24:54,308 INFO L614 ElimStorePlain]: treesize reduction 13, result has 31.6 percent of original size [2019-12-07 17:24:54,308 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:24:54,308 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 17:24:54,329 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:24:54,330 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:24:54,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:24:54,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:24:54,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:24:54,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:24:54,415 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:24:54,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328167527] [2019-12-07 17:24:54,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:24:54,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-12-07 17:24:54,415 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26036688] [2019-12-07 17:24:54,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:24:54,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:24:54,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:24:54,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:24:54,416 INFO L87 Difference]: Start difference. First operand 124 states and 171 transitions. Second operand 13 states. [2019-12-07 17:25:40,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:40,122 INFO L93 Difference]: Finished difference Result 270 states and 402 transitions. [2019-12-07 17:25:40,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:25:40,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-12-07 17:25:40,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:40,125 INFO L225 Difference]: With dead ends: 270 [2019-12-07 17:25:40,125 INFO L226 Difference]: Without dead ends: 160 [2019-12-07 17:25:40,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:25:40,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-12-07 17:25:40,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 146. [2019-12-07 17:25:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-12-07 17:25:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 203 transitions. [2019-12-07 17:25:40,137 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 203 transitions. Word has length 28 [2019-12-07 17:25:40,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:40,138 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 203 transitions. [2019-12-07 17:25:40,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:25:40,138 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 203 transitions. [2019-12-07 17:25:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:25:40,139 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:40,139 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] [2019-12-07 17:25:40,339 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 17:25:40,340 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:40,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:40,341 INFO L82 PathProgramCache]: Analyzing trace with hash 571761420, now seen corresponding path program 1 times [2019-12-07 17:25:40,341 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:25:40,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [645088722] [2019-12-07 17:25:40,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:25:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:40,540 INFO L264 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 17:25:40,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:25:40,556 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 11 treesize of output 7 [2019-12-07 17:25:40,557 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:40,561 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:40,561 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:25:40,561 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 17:25:40,596 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:40,596 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 17:25:40,596 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:40,614 INFO L614 ElimStorePlain]: treesize reduction 16, result has 52.9 percent of original size [2019-12-07 17:25:40,614 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 17:25:40,614 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-12-07 17:25:40,628 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 15 treesize of output 7 [2019-12-07 17:25:40,628 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:40,630 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:40,630 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:25:40,630 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 17:25:40,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:25:40,647 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:25:40,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:40,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:40,694 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:25:40,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [645088722] [2019-12-07 17:25:40,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:25:40,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2019-12-07 17:25:40,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4680183] [2019-12-07 17:25:40,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:25:40,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:25:40,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:25:40,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:25:40,695 INFO L87 Difference]: Start difference. First operand 146 states and 203 transitions. Second operand 6 states. [2019-12-07 17:25:45,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:25:45,586 INFO L93 Difference]: Finished difference Result 389 states and 592 transitions. [2019-12-07 17:25:45,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:25:45,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 17:25:45,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:25:45,590 INFO L225 Difference]: With dead ends: 389 [2019-12-07 17:25:45,590 INFO L226 Difference]: Without dead ends: 257 [2019-12-07 17:25:45,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:25:45,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2019-12-07 17:25:45,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 246. [2019-12-07 17:25:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-12-07 17:25:45,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 363 transitions. [2019-12-07 17:25:45,619 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 363 transitions. Word has length 28 [2019-12-07 17:25:45,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:25:45,619 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 363 transitions. [2019-12-07 17:25:45,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:25:45,619 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 363 transitions. [2019-12-07 17:25:45,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:25:45,621 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:25:45,621 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] [2019-12-07 17:25:45,822 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 17:25:45,823 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:25:45,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:25:45,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2025119411, now seen corresponding path program 1 times [2019-12-07 17:25:45,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:25:45,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1040659918] [2019-12-07 17:25:45,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:25:45,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:25:45,970 INFO L264 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:25:45,971 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:25:45,974 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 11 treesize of output 7 [2019-12-07 17:25:45,975 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:45,977 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:25:45,977 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:25:45,977 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:25:46,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:46,005 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 16 treesize of output 8 [2019-12-07 17:25:46,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:46,007 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 15 treesize of output 7 [2019-12-07 17:25:46,007 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:25:46,013 INFO L614 ElimStorePlain]: treesize reduction 11, result has 15.4 percent of original size [2019-12-07 17:25:46,013 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:25:46,013 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:2 [2019-12-07 17:25:46,020 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:25:46,021 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:25:46,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:25:46,072 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:25:46,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1040659918] [2019-12-07 17:25:46,072 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:25:46,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-12-07 17:25:46,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084169389] [2019-12-07 17:25:46,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:25:46,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:25:46,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:25:46,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:25:46,074 INFO L87 Difference]: Start difference. First operand 246 states and 363 transitions. Second operand 11 states. [2019-12-07 17:26:08,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:08,087 INFO L93 Difference]: Finished difference Result 489 states and 723 transitions. [2019-12-07 17:26:08,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:26:08,088 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2019-12-07 17:26:08,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:08,091 INFO L225 Difference]: With dead ends: 489 [2019-12-07 17:26:08,091 INFO L226 Difference]: Without dead ends: 252 [2019-12-07 17:26:08,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:26:08,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2019-12-07 17:26:08,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 249. [2019-12-07 17:26:08,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-12-07 17:26:08,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 366 transitions. [2019-12-07 17:26:08,108 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 366 transitions. Word has length 29 [2019-12-07 17:26:08,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:08,108 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 366 transitions. [2019-12-07 17:26:08,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:26:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 366 transitions. [2019-12-07 17:26:08,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:26:08,110 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:08,110 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] [2019-12-07 17:26:08,310 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 17:26:08,311 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:08,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:08,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1907924199, now seen corresponding path program 1 times [2019-12-07 17:26:08,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:26:08,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [462011403] [2019-12-07 17:26:08,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:26:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:08,445 INFO L264 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 17:26:08,446 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:26:08,449 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 11 treesize of output 7 [2019-12-07 17:26:08,450 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:08,451 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:08,451 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:08,452 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:26:08,478 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 15 treesize of output 7 [2019-12-07 17:26:08,479 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:08,480 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 15 treesize of output 7 [2019-12-07 17:26:08,481 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:08,491 INFO L614 ElimStorePlain]: treesize reduction 13, result has 31.6 percent of original size [2019-12-07 17:26:08,491 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:26:08,491 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 17:26:08,515 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:26:08,515 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:26:08,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:08,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:08,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:08,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:08,603 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:26:08,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [462011403] [2019-12-07 17:26:08,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:08,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-12-07 17:26:08,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764603830] [2019-12-07 17:26:08,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:26:08,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:26:08,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:26:08,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:26:08,605 INFO L87 Difference]: Start difference. First operand 249 states and 366 transitions. Second operand 13 states. [2019-12-07 17:26:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:24,336 INFO L93 Difference]: Finished difference Result 483 states and 715 transitions. [2019-12-07 17:26:24,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:26:24,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-12-07 17:26:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:24,338 INFO L225 Difference]: With dead ends: 483 [2019-12-07 17:26:24,338 INFO L226 Difference]: Without dead ends: 247 [2019-12-07 17:26:24,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:26:24,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-12-07 17:26:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2019-12-07 17:26:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-12-07 17:26:24,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 361 transitions. [2019-12-07 17:26:24,351 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 361 transitions. Word has length 30 [2019-12-07 17:26:24,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:24,351 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 361 transitions. [2019-12-07 17:26:24,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:26:24,352 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 361 transitions. [2019-12-07 17:26:24,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 17:26:24,353 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:24,353 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] [2019-12-07 17:26:24,553 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 17:26:24,554 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:24,555 INFO L82 PathProgramCache]: Analyzing trace with hash -887190847, now seen corresponding path program 1 times [2019-12-07 17:26:24,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:26:24,556 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610307210] [2019-12-07 17:26:24,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:26:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:24,694 INFO L264 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:26:24,696 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:26:24,699 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 11 treesize of output 7 [2019-12-07 17:26:24,699 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:24,701 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:24,701 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:24,701 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:26:24,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:24,727 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 7 treesize of output 3 [2019-12-07 17:26:24,727 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:24,728 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:24,728 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:26:24,728 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2019-12-07 17:26:24,736 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:26:24,736 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:26:24,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:24,740 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:26:24,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610307210] [2019-12-07 17:26:24,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:24,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 17:26:24,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767458430] [2019-12-07 17:26:24,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:26:24,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:26:24,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:26:24,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:26:24,741 INFO L87 Difference]: Start difference. First operand 245 states and 361 transitions. Second operand 7 states. [2019-12-07 17:26:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:36,266 INFO L93 Difference]: Finished difference Result 487 states and 782 transitions. [2019-12-07 17:26:36,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:26:36,266 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 30 [2019-12-07 17:26:36,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:36,268 INFO L225 Difference]: With dead ends: 487 [2019-12-07 17:26:36,268 INFO L226 Difference]: Without dead ends: 255 [2019-12-07 17:26:36,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:26:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-12-07 17:26:36,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2019-12-07 17:26:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-12-07 17:26:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 369 transitions. [2019-12-07 17:26:36,284 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 369 transitions. Word has length 30 [2019-12-07 17:26:36,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:36,284 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 369 transitions. [2019-12-07 17:26:36,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:26:36,284 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 369 transitions. [2019-12-07 17:26:36,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-07 17:26:36,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:36,286 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] [2019-12-07 17:26:36,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 17:26:36,486 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:36,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:36,487 INFO L82 PathProgramCache]: Analyzing trace with hash -1592982185, now seen corresponding path program 1 times [2019-12-07 17:26:36,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:26:36,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1309429475] [2019-12-07 17:26:36,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:26:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:36,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 17:26:36,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:26:36,648 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 11 treesize of output 7 [2019-12-07 17:26:36,649 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:36,652 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:36,653 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:36,653 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-12-07 17:26:36,684 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:36,685 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 1 case distinctions, treesize of input 19 treesize of output 34 [2019-12-07 17:26:36,685 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:36,699 INFO L614 ElimStorePlain]: treesize reduction 16, result has 52.9 percent of original size [2019-12-07 17:26:36,700 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 17:26:36,700 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:18 [2019-12-07 17:26:36,710 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 15 treesize of output 7 [2019-12-07 17:26:36,710 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:36,711 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:36,711 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:26:36,712 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-12-07 17:26:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:36,728 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:26:36,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:36,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:26:36,767 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:26:36,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1309429475] [2019-12-07 17:26:36,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:26:36,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 11 [2019-12-07 17:26:36,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910259882] [2019-12-07 17:26:36,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:26:36,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:26:36,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:26:36,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:26:36,768 INFO L87 Difference]: Start difference. First operand 253 states and 369 transitions. Second operand 6 states. [2019-12-07 17:26:41,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:26:41,604 INFO L93 Difference]: Finished difference Result 701 states and 1145 transitions. [2019-12-07 17:26:41,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:26:41,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-07 17:26:41,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:26:41,608 INFO L225 Difference]: With dead ends: 701 [2019-12-07 17:26:41,608 INFO L226 Difference]: Without dead ends: 423 [2019-12-07 17:26:41,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:26:41,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2019-12-07 17:26:41,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 284. [2019-12-07 17:26:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-12-07 17:26:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 407 transitions. [2019-12-07 17:26:41,623 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 407 transitions. Word has length 31 [2019-12-07 17:26:41,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:26:41,623 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 407 transitions. [2019-12-07 17:26:41,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:26:41,624 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 407 transitions. [2019-12-07 17:26:41,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:26:41,625 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:26:41,625 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:26:41,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 17:26:41,826 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:26:41,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:26:41,827 INFO L82 PathProgramCache]: Analyzing trace with hash -955605667, now seen corresponding path program 1 times [2019-12-07 17:26:41,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:26:41,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1163623154] [2019-12-07 17:26:41,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:26:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:26:41,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 17:26:41,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:26:41,971 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 11 treesize of output 7 [2019-12-07 17:26:41,971 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:41,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:41,973 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:26:41,973 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:26:42,005 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 15 treesize of output 7 [2019-12-07 17:26:42,006 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:26:42,008 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:26:42,008 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:26:42,008 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:26:42,020 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:42,020 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:26:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:26:42,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1163623154] [2019-12-07 17:26:42,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:26:42,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 17:26:42,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083785297] [2019-12-07 17:26:42,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:26:42,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:26:42,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:26:42,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:26:42,084 INFO L87 Difference]: Start difference. First operand 284 states and 407 transitions. Second operand 12 states. [2019-12-07 17:27:01,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:01,177 INFO L93 Difference]: Finished difference Result 634 states and 985 transitions. [2019-12-07 17:27:01,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:27:01,177 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2019-12-07 17:27:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:01,180 INFO L225 Difference]: With dead ends: 634 [2019-12-07 17:27:01,180 INFO L226 Difference]: Without dead ends: 361 [2019-12-07 17:27:01,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:27:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-12-07 17:27:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 327. [2019-12-07 17:27:01,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-12-07 17:27:01,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 460 transitions. [2019-12-07 17:27:01,199 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 460 transitions. Word has length 41 [2019-12-07 17:27:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:01,199 INFO L462 AbstractCegarLoop]: Abstraction has 327 states and 460 transitions. [2019-12-07 17:27:01,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:27:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 460 transitions. [2019-12-07 17:27:01,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:27:01,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:01,201 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:27:01,402 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 17:27:01,403 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:01,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:01,404 INFO L82 PathProgramCache]: Analyzing trace with hash -794400909, now seen corresponding path program 1 times [2019-12-07 17:27:01,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:27:01,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485427720] [2019-12-07 17:27:01,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:27:01,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:01,538 INFO L264 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:27:01,539 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:01,544 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:27:01,544 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:27:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:27:01,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485427720] [2019-12-07 17:27:01,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:01,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:27:01,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904129273] [2019-12-07 17:27:01,553 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:27:01,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:27:01,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:27:01,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:27:01,554 INFO L87 Difference]: Start difference. First operand 327 states and 460 transitions. Second operand 4 states. [2019-12-07 17:27:01,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:01,573 INFO L93 Difference]: Finished difference Result 610 states and 921 transitions. [2019-12-07 17:27:01,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:27:01,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-07 17:27:01,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:01,575 INFO L225 Difference]: With dead ends: 610 [2019-12-07 17:27:01,575 INFO L226 Difference]: Without dead ends: 333 [2019-12-07 17:27:01,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 76 SyntacticMatches, 2 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 17:27:01,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-07 17:27:01,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2019-12-07 17:27:01,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2019-12-07 17:27:01,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 465 transitions. [2019-12-07 17:27:01,587 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 465 transitions. Word has length 41 [2019-12-07 17:27:01,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:01,587 INFO L462 AbstractCegarLoop]: Abstraction has 333 states and 465 transitions. [2019-12-07 17:27:01,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:27:01,587 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 465 transitions. [2019-12-07 17:27:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:27:01,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:01,589 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:27:01,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 17:27:01,789 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:01,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:01,790 INFO L82 PathProgramCache]: Analyzing trace with hash -540510950, now seen corresponding path program 1 times [2019-12-07 17:27:01,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:27:01,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329434464] [2019-12-07 17:27:01,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:27:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:01,972 INFO L264 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:27:01,973 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:01,977 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 11 treesize of output 7 [2019-12-07 17:27:01,977 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:01,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:27:01,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:27:01,979 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:27:02,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:02,004 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 16 treesize of output 8 [2019-12-07 17:27:02,004 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:02,005 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 15 treesize of output 7 [2019-12-07 17:27:02,005 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:02,011 INFO L614 ElimStorePlain]: treesize reduction 11, result has 15.4 percent of original size [2019-12-07 17:27:02,011 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:27:02,011 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:2 [2019-12-07 17:27:02,026 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:27:02,027 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:27:02,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:02,083 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:27:02,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329434464] [2019-12-07 17:27:02,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:02,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-12-07 17:27:02,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229045886] [2019-12-07 17:27:02,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:27:02,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:27:02,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:27:02,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:27:02,084 INFO L87 Difference]: Start difference. First operand 333 states and 465 transitions. Second operand 11 states. [2019-12-07 17:27:17,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:17,830 INFO L93 Difference]: Finished difference Result 639 states and 961 transitions. [2019-12-07 17:27:17,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:27:17,831 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2019-12-07 17:27:17,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:17,833 INFO L225 Difference]: With dead ends: 639 [2019-12-07 17:27:17,833 INFO L226 Difference]: Without dead ends: 356 [2019-12-07 17:27:17,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:27:17,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-12-07 17:27:17,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 342. [2019-12-07 17:27:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-12-07 17:27:17,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 478 transitions. [2019-12-07 17:27:17,844 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 478 transitions. Word has length 42 [2019-12-07 17:27:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:17,844 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 478 transitions. [2019-12-07 17:27:17,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:27:17,845 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 478 transitions. [2019-12-07 17:27:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:27:17,846 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:17,846 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:27:18,046 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 17:27:18,046 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:18,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:18,047 INFO L82 PathProgramCache]: Analyzing trace with hash -478471336, now seen corresponding path program 1 times [2019-12-07 17:27:18,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:27:18,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825268841] [2019-12-07 17:27:18,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:27:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:18,190 INFO L264 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 17:27:18,192 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:18,196 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 11 treesize of output 7 [2019-12-07 17:27:18,196 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:18,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:27:18,198 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:27:18,198 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:27:18,221 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 15 treesize of output 7 [2019-12-07 17:27:18,221 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:18,223 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 15 treesize of output 7 [2019-12-07 17:27:18,223 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:18,233 INFO L614 ElimStorePlain]: treesize reduction 13, result has 31.6 percent of original size [2019-12-07 17:27:18,233 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:27:18,233 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 17:27:18,253 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:27:18,254 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:27:18,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:18,326 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:27:18,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825268841] [2019-12-07 17:27:18,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:18,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-12-07 17:27:18,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919179037] [2019-12-07 17:27:18,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:27:18,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:27:18,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:27:18,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:27:18,328 INFO L87 Difference]: Start difference. First operand 342 states and 478 transitions. Second operand 13 states. [2019-12-07 17:27:34,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:34,290 INFO L93 Difference]: Finished difference Result 673 states and 1028 transitions. [2019-12-07 17:27:34,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:27:34,291 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2019-12-07 17:27:34,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:34,293 INFO L225 Difference]: With dead ends: 673 [2019-12-07 17:27:34,293 INFO L226 Difference]: Without dead ends: 381 [2019-12-07 17:27:34,294 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:27:34,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-12-07 17:27:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 363. [2019-12-07 17:27:34,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-12-07 17:27:34,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 508 transitions. [2019-12-07 17:27:34,305 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 508 transitions. Word has length 42 [2019-12-07 17:27:34,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:34,305 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 508 transitions. [2019-12-07 17:27:34,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:27:34,305 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 508 transitions. [2019-12-07 17:27:34,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:27:34,306 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:34,306 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:27:34,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 17:27:34,507 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1534939229, now seen corresponding path program 1 times [2019-12-07 17:27:34,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:27:34,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1939134867] [2019-12-07 17:27:34,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:27:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:34,603 INFO L264 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:27:34,604 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:34,638 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 15 treesize of output 7 [2019-12-07 17:27:34,638 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:34,642 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:27:34,642 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:27:34,642 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-12-07 17:27:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:27:34,653 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:27:34,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:34,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:34,708 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 17 treesize of output 9 [2019-12-07 17:27:34,708 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:34,709 INFO L614 ElimStorePlain]: treesize reduction 3, result has 25.0 percent of original size [2019-12-07 17:27:34,710 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:27:34,710 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2019-12-07 17:27:34,712 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 17:27:34,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1939134867] [2019-12-07 17:27:34,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:34,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 17:27:34,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775330157] [2019-12-07 17:27:34,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:27:34,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:27:34,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:27:34,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:27:34,713 INFO L87 Difference]: Start difference. First operand 363 states and 508 transitions. Second operand 12 states. [2019-12-07 17:27:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:47,651 INFO L93 Difference]: Finished difference Result 1171 states and 2006 transitions. [2019-12-07 17:27:47,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:27:47,652 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-12-07 17:27:47,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:47,657 INFO L225 Difference]: With dead ends: 1171 [2019-12-07 17:27:47,657 INFO L226 Difference]: Without dead ends: 820 [2019-12-07 17:27:47,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:27:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2019-12-07 17:27:47,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 792. [2019-12-07 17:27:47,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2019-12-07 17:27:47,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1340 transitions. [2019-12-07 17:27:47,689 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1340 transitions. Word has length 42 [2019-12-07 17:27:47,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:47,689 INFO L462 AbstractCegarLoop]: Abstraction has 792 states and 1340 transitions. [2019-12-07 17:27:47,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:27:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1340 transitions. [2019-12-07 17:27:47,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:27:47,691 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:47,691 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:27:47,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 17:27:47,891 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:47,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:47,892 INFO L82 PathProgramCache]: Analyzing trace with hash -948133215, now seen corresponding path program 1 times [2019-12-07 17:27:47,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:27:47,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [324690769] [2019-12-07 17:27:47,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:27:47,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:47,992 INFO L264 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:27:47,993 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:48,000 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 11 treesize of output 7 [2019-12-07 17:27:48,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:48,002 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:27:48,003 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:27:48,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:27:48,009 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 15 treesize of output 7 [2019-12-07 17:27:48,009 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:48,010 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:27:48,011 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:27:48,011 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:27:48,046 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:27:48,046 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:27:48,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:48,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:48,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:48,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:48,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:48,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:27:48,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:27:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:27:48,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [324690769] [2019-12-07 17:27:48,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:48,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 12 [2019-12-07 17:27:48,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647533860] [2019-12-07 17:27:48,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:27:48,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:27:48,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:27:48,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:27:48,117 INFO L87 Difference]: Start difference. First operand 792 states and 1340 transitions. Second operand 12 states. [2019-12-07 17:27:53,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:27:53,581 INFO L93 Difference]: Finished difference Result 1669 states and 3314 transitions. [2019-12-07 17:27:53,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:27:53,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2019-12-07 17:27:53,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:27:53,587 INFO L225 Difference]: With dead ends: 1669 [2019-12-07 17:27:53,587 INFO L226 Difference]: Without dead ends: 937 [2019-12-07 17:27:53,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:27:53,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-12-07 17:27:53,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 900. [2019-12-07 17:27:53,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 900 states. [2019-12-07 17:27:53,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 900 states to 900 states and 1536 transitions. [2019-12-07 17:27:53,626 INFO L78 Accepts]: Start accepts. Automaton has 900 states and 1536 transitions. Word has length 42 [2019-12-07 17:27:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:27:53,627 INFO L462 AbstractCegarLoop]: Abstraction has 900 states and 1536 transitions. [2019-12-07 17:27:53,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:27:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 900 states and 1536 transitions. [2019-12-07 17:27:53,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 17:27:53,628 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:27:53,628 INFO L410 BasicCegarLoop]: trace histogram [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 17:27:53,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 17:27:53,829 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:27:53,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:27:53,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1828765838, now seen corresponding path program 1 times [2019-12-07 17:27:53,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:27:53,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [25912767] [2019-12-07 17:27:53,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:27:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:27:53,973 INFO L264 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:27:53,974 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:27:53,977 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 11 treesize of output 7 [2019-12-07 17:27:53,978 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:53,979 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:27:53,979 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:27:53,979 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:27:54,001 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 15 treesize of output 7 [2019-12-07 17:27:54,001 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:27:54,003 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:27:54,003 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:27:54,003 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:27:54,019 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:27:54,019 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:27:54,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:27:54,025 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:27:54,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [25912767] [2019-12-07 17:27:54,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:27:54,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-07 17:27:54,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708425843] [2019-12-07 17:27:54,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:27:54,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:27:54,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:27:54,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:27:54,027 INFO L87 Difference]: Start difference. First operand 900 states and 1536 transitions. Second operand 8 states. [2019-12-07 17:28:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:06,896 INFO L93 Difference]: Finished difference Result 1819 states and 3652 transitions. [2019-12-07 17:28:06,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:28:06,897 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2019-12-07 17:28:06,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:06,903 INFO L225 Difference]: With dead ends: 1819 [2019-12-07 17:28:06,903 INFO L226 Difference]: Without dead ends: 979 [2019-12-07 17:28:06,908 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:28:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2019-12-07 17:28:06,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 965. [2019-12-07 17:28:06,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-12-07 17:28:06,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1638 transitions. [2019-12-07 17:28:06,940 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1638 transitions. Word has length 42 [2019-12-07 17:28:06,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:06,940 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1638 transitions. [2019-12-07 17:28:06,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:28:06,941 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1638 transitions. [2019-12-07 17:28:06,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-07 17:28:06,942 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:06,942 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 17:28:07,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 17:28:07,143 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:07,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:07,144 INFO L82 PathProgramCache]: Analyzing trace with hash -757221373, now seen corresponding path program 1 times [2019-12-07 17:28:07,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:28:07,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [158750720] [2019-12-07 17:28:07,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:28:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:07,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:28:07,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:07,314 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 11 treesize of output 7 [2019-12-07 17:28:07,315 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:28:07,316 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:28:07,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:28:07,316 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:28:07,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:07,338 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 16 treesize of output 8 [2019-12-07 17:28:07,338 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:28:07,340 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 15 treesize of output 7 [2019-12-07 17:28:07,340 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:28:07,345 INFO L614 ElimStorePlain]: treesize reduction 11, result has 15.4 percent of original size [2019-12-07 17:28:07,345 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:28:07,345 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:2 [2019-12-07 17:28:07,352 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:07,353 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:28:07,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:07,407 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:28:07,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [158750720] [2019-12-07 17:28:07,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:07,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 11 [2019-12-07 17:28:07,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005230257] [2019-12-07 17:28:07,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:28:07,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:28:07,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:28:07,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:28:07,408 INFO L87 Difference]: Start difference. First operand 965 states and 1638 transitions. Second operand 11 states. [2019-12-07 17:28:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:29,505 INFO L93 Difference]: Finished difference Result 1988 states and 4011 transitions. [2019-12-07 17:28:29,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 17:28:29,505 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-12-07 17:28:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:29,515 INFO L225 Difference]: With dead ends: 1988 [2019-12-07 17:28:29,515 INFO L226 Difference]: Without dead ends: 1046 [2019-12-07 17:28:29,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:28:29,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2019-12-07 17:28:29,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 996. [2019-12-07 17:28:29,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 996 states. [2019-12-07 17:28:29,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 1675 transitions. [2019-12-07 17:28:29,566 INFO L78 Accepts]: Start accepts. Automaton has 996 states and 1675 transitions. Word has length 43 [2019-12-07 17:28:29,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:29,567 INFO L462 AbstractCegarLoop]: Abstraction has 996 states and 1675 transitions. [2019-12-07 17:28:29,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:28:29,567 INFO L276 IsEmpty]: Start isEmpty. Operand 996 states and 1675 transitions. [2019-12-07 17:28:29,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-07 17:28:29,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:29,569 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 17:28:29,769 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 17:28:29,769 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:29,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:29,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1846598544, now seen corresponding path program 1 times [2019-12-07 17:28:29,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:28:29,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817150276] [2019-12-07 17:28:29,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:28:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:29,906 INFO L264 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:28:29,907 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:29,921 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:28:29,921 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:28:29,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:28:29,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817150276] [2019-12-07 17:28:29,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:29,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 17:28:29,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862637332] [2019-12-07 17:28:29,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:28:29,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:28:29,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:28:29,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:29,936 INFO L87 Difference]: Start difference. First operand 996 states and 1675 transitions. Second operand 5 states. [2019-12-07 17:28:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:29,980 INFO L93 Difference]: Finished difference Result 1957 states and 3958 transitions. [2019-12-07 17:28:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:28:29,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-07 17:28:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:29,990 INFO L225 Difference]: With dead ends: 1957 [2019-12-07 17:28:29,990 INFO L226 Difference]: Without dead ends: 1021 [2019-12-07 17:28:29,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:28:29,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2019-12-07 17:28:30,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 1000. [2019-12-07 17:28:30,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1000 states. [2019-12-07 17:28:30,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1000 states to 1000 states and 1681 transitions. [2019-12-07 17:28:30,033 INFO L78 Accepts]: Start accepts. Automaton has 1000 states and 1681 transitions. Word has length 46 [2019-12-07 17:28:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:30,033 INFO L462 AbstractCegarLoop]: Abstraction has 1000 states and 1681 transitions. [2019-12-07 17:28:30,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:28:30,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1000 states and 1681 transitions. [2019-12-07 17:28:30,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:28:30,035 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:30,035 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-12-07 17:28:30,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 17:28:30,236 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:30,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:30,236 INFO L82 PathProgramCache]: Analyzing trace with hash 915885638, now seen corresponding path program 1 times [2019-12-07 17:28:30,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:28:30,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172419217] [2019-12-07 17:28:30,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:28:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:30,358 INFO L264 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:28:30,359 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:30,362 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 11 treesize of output 7 [2019-12-07 17:28:30,362 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:28:30,364 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:28:30,364 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:28:30,364 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:28:30,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:30,386 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 7 treesize of output 3 [2019-12-07 17:28:30,386 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:28:30,388 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:28:30,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 17:28:30,388 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2019-12-07 17:28:30,395 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:28:30,395 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:28:30,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:30,401 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:28:30,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [172419217] [2019-12-07 17:28:30,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:30,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 17:28:30,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522707639] [2019-12-07 17:28:30,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:28:30,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:28:30,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:28:30,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:28:30,402 INFO L87 Difference]: Start difference. First operand 1000 states and 1681 transitions. Second operand 7 states. [2019-12-07 17:28:41,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:41,334 INFO L93 Difference]: Finished difference Result 1971 states and 3909 transitions. [2019-12-07 17:28:41,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:28:41,335 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-12-07 17:28:41,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:41,342 INFO L225 Difference]: With dead ends: 1971 [2019-12-07 17:28:41,343 INFO L226 Difference]: Without dead ends: 1030 [2019-12-07 17:28:41,349 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:28:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-12-07 17:28:41,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 1005. [2019-12-07 17:28:41,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-12-07 17:28:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1694 transitions. [2019-12-07 17:28:41,393 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1694 transitions. Word has length 47 [2019-12-07 17:28:41,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:41,393 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 1694 transitions. [2019-12-07 17:28:41,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:28:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1694 transitions. [2019-12-07 17:28:41,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:28:41,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:41,396 INFO L410 BasicCegarLoop]: trace histogram [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, 1] [2019-12-07 17:28:41,596 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 17:28:41,597 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:41,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:41,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1590121504, now seen corresponding path program 1 times [2019-12-07 17:28:41,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:28:41,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [718979824] [2019-12-07 17:28:41,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:28:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:41,761 INFO L264 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:28:41,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:28:41,769 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:28:41,777 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:28:41,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [718979824] [2019-12-07 17:28:41,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:41,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:28:41,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519825033] [2019-12-07 17:28:41,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:28:41,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:28:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:28:41,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:28:41,778 INFO L87 Difference]: Start difference. First operand 1005 states and 1694 transitions. Second operand 4 states. [2019-12-07 17:28:41,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:28:41,808 INFO L93 Difference]: Finished difference Result 1987 states and 3904 transitions. [2019-12-07 17:28:41,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:28:41,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 17:28:41,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:28:41,814 INFO L225 Difference]: With dead ends: 1987 [2019-12-07 17:28:41,814 INFO L226 Difference]: Without dead ends: 1007 [2019-12-07 17:28:41,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 92 SyntacticMatches, 2 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 17:28:41,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2019-12-07 17:28:41,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 1005. [2019-12-07 17:28:41,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1005 states. [2019-12-07 17:28:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1005 states to 1005 states and 1683 transitions. [2019-12-07 17:28:41,855 INFO L78 Accepts]: Start accepts. Automaton has 1005 states and 1683 transitions. Word has length 49 [2019-12-07 17:28:41,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:28:41,855 INFO L462 AbstractCegarLoop]: Abstraction has 1005 states and 1683 transitions. [2019-12-07 17:28:41,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:28:41,855 INFO L276 IsEmpty]: Start isEmpty. Operand 1005 states and 1683 transitions. [2019-12-07 17:28:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:28:41,857 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:28:41,857 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-12-07 17:28:42,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 17:28:42,058 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:28:42,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:28:42,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1903089381, now seen corresponding path program 1 times [2019-12-07 17:28:42,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:28:42,059 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504355946] [2019-12-07 17:28:42,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:28:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:28:42,218 INFO L264 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 17:28:42,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:28:42,253 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 15 treesize of output 7 [2019-12-07 17:28:42,253 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:28:42,256 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:28:42,256 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:28:42,256 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-12-07 17:28:42,269 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:28:42,269 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:28:42,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:42,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:28:42,326 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 17 treesize of output 9 [2019-12-07 17:28:42,326 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:28:42,327 INFO L614 ElimStorePlain]: treesize reduction 3, result has 25.0 percent of original size [2019-12-07 17:28:42,327 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:28:42,327 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2019-12-07 17:28:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 17:28:42,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504355946] [2019-12-07 17:28:42,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:28:42,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 17:28:42,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215738900] [2019-12-07 17:28:42,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:28:42,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:28:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:28:42,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:28:42,331 INFO L87 Difference]: Start difference. First operand 1005 states and 1683 transitions. Second operand 12 states. [2019-12-07 17:29:06,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:06,313 INFO L93 Difference]: Finished difference Result 2825 states and 6585 transitions. [2019-12-07 17:29:06,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:29:06,313 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-12-07 17:29:06,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:06,328 INFO L225 Difference]: With dead ends: 2825 [2019-12-07 17:29:06,328 INFO L226 Difference]: Without dead ends: 1845 [2019-12-07 17:29:06,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:29:06,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2019-12-07 17:29:06,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1538. [2019-12-07 17:29:06,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-12-07 17:29:06,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 3123 transitions. [2019-12-07 17:29:06,408 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 3123 transitions. Word has length 50 [2019-12-07 17:29:06,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:06,409 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 3123 transitions. [2019-12-07 17:29:06,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:29:06,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 3123 transitions. [2019-12-07 17:29:06,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 17:29:06,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:06,410 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1] [2019-12-07 17:29:06,611 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-12-07 17:29:06,611 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:06,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:06,611 INFO L82 PathProgramCache]: Analyzing trace with hash 214285764, now seen corresponding path program 1 times [2019-12-07 17:29:06,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:29:06,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [123646227] [2019-12-07 17:29:06,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:29:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:06,742 INFO L264 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 17:29:06,743 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:29:06,754 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:29:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:29:06,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [123646227] [2019-12-07 17:29:06,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:06,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-12-07 17:29:06,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680247471] [2019-12-07 17:29:06,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:29:06,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:29:06,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:29:06,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:06,800 INFO L87 Difference]: Start difference. First operand 1538 states and 3123 transitions. Second operand 5 states. [2019-12-07 17:29:06,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:06,847 INFO L93 Difference]: Finished difference Result 3078 states and 8110 transitions. [2019-12-07 17:29:06,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:29:06,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-07 17:29:06,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:06,861 INFO L225 Difference]: With dead ends: 3078 [2019-12-07 17:29:06,861 INFO L226 Difference]: Without dead ends: 1576 [2019-12-07 17:29:06,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:29:06,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-12-07 17:29:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1540. [2019-12-07 17:29:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1540 states. [2019-12-07 17:29:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1540 states to 1540 states and 3125 transitions. [2019-12-07 17:29:06,923 INFO L78 Accepts]: Start accepts. Automaton has 1540 states and 3125 transitions. Word has length 47 [2019-12-07 17:29:06,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:06,923 INFO L462 AbstractCegarLoop]: Abstraction has 1540 states and 3125 transitions. [2019-12-07 17:29:06,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:29:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1540 states and 3125 transitions. [2019-12-07 17:29:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 17:29:06,925 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:06,926 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-12-07 17:29:07,126 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-12-07 17:29:07,126 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:07,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:07,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1192209372, now seen corresponding path program 1 times [2019-12-07 17:29:07,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:29:07,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [843987436] [2019-12-07 17:29:07,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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:29:07,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:07,258 INFO L264 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 17:29:07,259 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:29:07,264 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:29:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:29:07,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [843987436] [2019-12-07 17:29:07,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:07,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-12-07 17:29:07,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919755374] [2019-12-07 17:29:07,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:29:07,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:29:07,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:29:07,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:29:07,274 INFO L87 Difference]: Start difference. First operand 1540 states and 3125 transitions. Second operand 4 states. [2019-12-07 17:29:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:07,331 INFO L93 Difference]: Finished difference Result 3164 states and 8433 transitions. [2019-12-07 17:29:07,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:29:07,332 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-12-07 17:29:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:07,344 INFO L225 Difference]: With dead ends: 3164 [2019-12-07 17:29:07,345 INFO L226 Difference]: Without dead ends: 1660 [2019-12-07 17:29:07,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 90 SyntacticMatches, 2 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 17:29:07,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1660 states. [2019-12-07 17:29:07,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1660 to 1660. [2019-12-07 17:29:07,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1660 states. [2019-12-07 17:29:07,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1660 states to 1660 states and 3663 transitions. [2019-12-07 17:29:07,408 INFO L78 Accepts]: Start accepts. Automaton has 1660 states and 3663 transitions. Word has length 48 [2019-12-07 17:29:07,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:07,408 INFO L462 AbstractCegarLoop]: Abstraction has 1660 states and 3663 transitions. [2019-12-07 17:29:07,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:29:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1660 states and 3663 transitions. [2019-12-07 17:29:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:29:07,410 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:07,410 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2019-12-07 17:29:07,610 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-12-07 17:29:07,611 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:07,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:07,611 INFO L82 PathProgramCache]: Analyzing trace with hash -1407247106, now seen corresponding path program 1 times [2019-12-07 17:29:07,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:29:07,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101801066] [2019-12-07 17:29:07,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 17:29:07,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:07,777 INFO L264 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:29:07,778 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:07,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 11 treesize of output 7 [2019-12-07 17:29:07,782 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:07,783 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:29:07,784 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:29:07,784 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:29:07,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:07,806 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 7 treesize of output 3 [2019-12-07 17:29:07,807 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:07,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:29:07,808 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:29:07,808 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:9, output treesize:1 [2019-12-07 17:29:07,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:29:07,815 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:29:07,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:07,821 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:29:07,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101801066] [2019-12-07 17:29:07,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:07,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-12-07 17:29:07,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619106414] [2019-12-07 17:29:07,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:29:07,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:29:07,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:29:07,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:29:07,822 INFO L87 Difference]: Start difference. First operand 1660 states and 3663 transitions. Second operand 7 states. [2019-12-07 17:29:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:21,233 INFO L93 Difference]: Finished difference Result 3376 states and 9781 transitions. [2019-12-07 17:29:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:29:21,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2019-12-07 17:29:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:21,249 INFO L225 Difference]: With dead ends: 3376 [2019-12-07 17:29:21,249 INFO L226 Difference]: Without dead ends: 1752 [2019-12-07 17:29:21,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:29:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1752 states. [2019-12-07 17:29:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1752 to 1724. [2019-12-07 17:29:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-12-07 17:29:21,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3757 transitions. [2019-12-07 17:29:21,331 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3757 transitions. Word has length 49 [2019-12-07 17:29:21,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:21,331 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 3757 transitions. [2019-12-07 17:29:21,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:29:21,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3757 transitions. [2019-12-07 17:29:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 17:29:21,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:21,333 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-12-07 17:29:21,533 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-12-07 17:29:21,534 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:21,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:21,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1652458348, now seen corresponding path program 1 times [2019-12-07 17:29:21,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:29:21,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77934407] [2019-12-07 17:29:21,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 17:29:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:21,738 INFO L264 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 17:29:21,739 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:21,743 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 11 treesize of output 7 [2019-12-07 17:29:21,743 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:21,745 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:29:21,745 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:29:21,746 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:29:21,769 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 15 treesize of output 7 [2019-12-07 17:29:21,769 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:21,770 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 15 treesize of output 7 [2019-12-07 17:29:21,771 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:21,780 INFO L614 ElimStorePlain]: treesize reduction 13, result has 31.6 percent of original size [2019-12-07 17:29:21,780 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:29:21,780 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:6 [2019-12-07 17:29:21,803 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:29:21,803 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:29:21,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:21,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:21,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:21,881 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:29:21,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77934407] [2019-12-07 17:29:21,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:21,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-12-07 17:29:21,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371251595] [2019-12-07 17:29:21,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 17:29:21,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:29:21,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 17:29:21,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:29:21,883 INFO L87 Difference]: Start difference. First operand 1724 states and 3757 transitions. Second operand 13 states. [2019-12-07 17:29:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:35,227 INFO L93 Difference]: Finished difference Result 3472 states and 9854 transitions. [2019-12-07 17:29:35,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 17:29:35,228 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 50 [2019-12-07 17:29:35,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:35,242 INFO L225 Difference]: With dead ends: 3472 [2019-12-07 17:29:35,243 INFO L226 Difference]: Without dead ends: 1784 [2019-12-07 17:29:35,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:29:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1784 states. [2019-12-07 17:29:35,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1784 to 1768. [2019-12-07 17:29:35,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1768 states. [2019-12-07 17:29:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 3829 transitions. [2019-12-07 17:29:35,311 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 3829 transitions. Word has length 50 [2019-12-07 17:29:35,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:35,311 INFO L462 AbstractCegarLoop]: Abstraction has 1768 states and 3829 transitions. [2019-12-07 17:29:35,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 17:29:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 3829 transitions. [2019-12-07 17:29:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 17:29:35,313 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:35,313 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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:29:35,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 mathsat -unsat_core_generation=3 [2019-12-07 17:29:35,513 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:35,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:35,514 INFO L82 PathProgramCache]: Analyzing trace with hash 2055690899, now seen corresponding path program 1 times [2019-12-07 17:29:35,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:29:35,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914369947] [2019-12-07 17:29:35,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 17:29:35,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:35,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 17:29:35,680 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:35,683 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 11 treesize of output 7 [2019-12-07 17:29:35,683 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:35,685 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:29:35,685 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:29:35,685 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:29:35,706 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 15 treesize of output 7 [2019-12-07 17:29:35,706 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:35,707 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:29:35,708 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:29:35,708 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-12-07 17:29:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:29:35,716 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:29:35,770 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 17:29:35,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914369947] [2019-12-07 17:29:35,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:29:35,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 17:29:35,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330852677] [2019-12-07 17:29:35,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 17:29:35,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:29:35,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 17:29:35,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:29:35,771 INFO L87 Difference]: Start difference. First operand 1768 states and 3829 transitions. Second operand 12 states. [2019-12-07 17:29:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:29:55,122 INFO L93 Difference]: Finished difference Result 3514 states and 9730 transitions. [2019-12-07 17:29:55,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:29:55,123 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-12-07 17:29:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:29:55,134 INFO L225 Difference]: With dead ends: 3514 [2019-12-07 17:29:55,135 INFO L226 Difference]: Without dead ends: 1782 [2019-12-07 17:29:55,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 98 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-07 17:29:55,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2019-12-07 17:29:55,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1775. [2019-12-07 17:29:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-12-07 17:29:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 3836 transitions. [2019-12-07 17:29:55,203 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 3836 transitions. Word has length 55 [2019-12-07 17:29:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:29:55,203 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 3836 transitions. [2019-12-07 17:29:55,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 17:29:55,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3836 transitions. [2019-12-07 17:29:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-07 17:29:55,205 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:29:55,205 INFO L410 BasicCegarLoop]: trace histogram [4, 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:29:55,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 mathsat -unsat_core_generation=3 [2019-12-07 17:29:55,406 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:29:55,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:29:55,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1444793314, now seen corresponding path program 1 times [2019-12-07 17:29:55,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:29:55,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770774393] [2019-12-07 17:29:55,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 17:29:55,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:29:55,580 INFO L264 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 17:29:55,582 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:29:55,595 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 16 treesize of output 8 [2019-12-07 17:29:55,595 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:55,597 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:29:55,597 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:29:55,598 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2019-12-07 17:29:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:29:55,631 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:29:55,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:55,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:29:55,686 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 16 treesize of output 8 [2019-12-07 17:29:55,686 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:55,687 INFO L614 ElimStorePlain]: treesize reduction 2, result has 33.3 percent of original size [2019-12-07 17:29:55,687 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:29:55,687 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2019-12-07 17:29:55,713 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 16 treesize of output 8 [2019-12-07 17:29:55,713 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:55,714 INFO L614 ElimStorePlain]: treesize reduction 2, result has 33.3 percent of original size [2019-12-07 17:29:55,714 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:29:55,714 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2019-12-07 17:29:55,734 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 16 treesize of output 8 [2019-12-07 17:29:55,734 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:29:55,735 INFO L614 ElimStorePlain]: treesize reduction 2, result has 33.3 percent of original size [2019-12-07 17:29:55,735 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:29:55,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:1 [2019-12-07 17:29:55,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:29:55,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770774393] [2019-12-07 17:29:55,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:29:55,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-12-07 17:29:55,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645360293] [2019-12-07 17:29:55,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:29:55,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:29:55,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:29:55,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:29:55,739 INFO L87 Difference]: Start difference. First operand 1775 states and 3836 transitions. Second operand 9 states. [2019-12-07 17:30:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:07,172 INFO L93 Difference]: Finished difference Result 4653 states and 13375 transitions. [2019-12-07 17:30:07,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:30:07,174 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-12-07 17:30:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:30:07,194 INFO L225 Difference]: With dead ends: 4653 [2019-12-07 17:30:07,194 INFO L226 Difference]: Without dead ends: 2913 [2019-12-07 17:30:07,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2019-12-07 17:30:07,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2019-12-07 17:30:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2853. [2019-12-07 17:30:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2853 states. [2019-12-07 17:30:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 6686 transitions. [2019-12-07 17:30:07,328 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 6686 transitions. Word has length 53 [2019-12-07 17:30:07,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:30:07,328 INFO L462 AbstractCegarLoop]: Abstraction has 2853 states and 6686 transitions. [2019-12-07 17:30:07,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:30:07,328 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 6686 transitions. [2019-12-07 17:30:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 17:30:07,332 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:30:07,332 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:30:07,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 mathsat -unsat_core_generation=3 [2019-12-07 17:30:07,532 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:30:07,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:07,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1857161727, now seen corresponding path program 1 times [2019-12-07 17:30:07,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:30:07,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461415967] [2019-12-07 17:30:07,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 17:30:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:07,710 INFO L264 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 17:30:07,711 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:07,780 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 32 treesize of output 16 [2019-12-07 17:30:07,780 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:07,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:07,784 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:30:07,784 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2019-12-07 17:30:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:30:07,840 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:30:07,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:07,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:07,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:07,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:07,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:07,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:30:07,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:30:07,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:30:08,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:30:08,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:08,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:08,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:08,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:30:08,163 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:30:08,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461415967] [2019-12-07 17:30:08,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 17:30:08,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 16 [2019-12-07 17:30:08,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477719800] [2019-12-07 17:30:08,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:30:08,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:30:08,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:30:08,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:30:08,164 INFO L87 Difference]: Start difference. First operand 2853 states and 6686 transitions. Second operand 16 states. [2019-12-07 17:30:21,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:21,348 INFO L93 Difference]: Finished difference Result 6015 states and 17223 transitions. [2019-12-07 17:30:21,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:30:21,349 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 60 [2019-12-07 17:30:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:30:21,367 INFO L225 Difference]: With dead ends: 6015 [2019-12-07 17:30:21,367 INFO L226 Difference]: Without dead ends: 3165 [2019-12-07 17:30:21,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 104 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:30:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3165 states. [2019-12-07 17:30:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3165 to 3101. [2019-12-07 17:30:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3101 states. [2019-12-07 17:30:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3101 states to 3101 states and 6907 transitions. [2019-12-07 17:30:21,495 INFO L78 Accepts]: Start accepts. Automaton has 3101 states and 6907 transitions. Word has length 60 [2019-12-07 17:30:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:30:21,496 INFO L462 AbstractCegarLoop]: Abstraction has 3101 states and 6907 transitions. [2019-12-07 17:30:21,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:30:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 3101 states and 6907 transitions. [2019-12-07 17:30:21,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 17:30:21,499 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:30:21,500 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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:30:21,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 mathsat -unsat_core_generation=3 [2019-12-07 17:30:21,700 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:30:21,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:21,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1576422707, now seen corresponding path program 1 times [2019-12-07 17:30:21,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:30:21,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1140497121] [2019-12-07 17:30:21,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 17:30:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:21,887 INFO L264 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 17:30:21,889 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:21,922 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 15 treesize of output 7 [2019-12-07 17:30:21,923 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:21,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:21,926 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:30:21,926 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:18, output treesize:7 [2019-12-07 17:30:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 17:30:21,939 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:30:21,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:22,002 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 17 treesize of output 9 [2019-12-07 17:30:22,002 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:22,004 INFO L614 ElimStorePlain]: treesize reduction 3, result has 25.0 percent of original size [2019-12-07 17:30:22,004 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:30:22,004 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:1 [2019-12-07 17:30:22,006 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 17:30:22,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1140497121] [2019-12-07 17:30:22,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 17:30:22,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-12-07 17:30:22,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973236603] [2019-12-07 17:30:22,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:30:22,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:30:22,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:30:22,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:30:22,007 INFO L87 Difference]: Start difference. First operand 3101 states and 6907 transitions. Second operand 7 states. [2019-12-07 17:30:31,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:31,028 INFO L93 Difference]: Finished difference Result 6546 states and 18747 transitions. [2019-12-07 17:30:31,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:30:31,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-12-07 17:30:31,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:30:31,046 INFO L225 Difference]: With dead ends: 6546 [2019-12-07 17:30:31,046 INFO L226 Difference]: Without dead ends: 3458 [2019-12-07 17:30:31,057 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:30:31,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3458 states. [2019-12-07 17:30:31,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3458 to 3430. [2019-12-07 17:30:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3430 states. [2019-12-07 17:30:31,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 7760 transitions. [2019-12-07 17:30:31,198 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 7760 transitions. Word has length 62 [2019-12-07 17:30:31,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:30:31,198 INFO L462 AbstractCegarLoop]: Abstraction has 3430 states and 7760 transitions. [2019-12-07 17:30:31,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:30:31,198 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 7760 transitions. [2019-12-07 17:30:31,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 17:30:31,203 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:30:31,203 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:30:31,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 mathsat -unsat_core_generation=3 [2019-12-07 17:30:31,404 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:30:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash -247395068, now seen corresponding path program 1 times [2019-12-07 17:30:31,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:30:31,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777512750] [2019-12-07 17:30:31,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 17:30:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:31,599 INFO L264 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 17:30:31,601 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:31,604 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 11 treesize of output 7 [2019-12-07 17:30:31,604 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:31,606 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:31,606 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:31,606 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-12-07 17:30:31,611 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 7 treesize of output 3 [2019-12-07 17:30:31,611 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:31,612 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:31,613 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:30:31,613 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:11, output treesize:3 [2019-12-07 17:30:31,696 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 17:30:31,696 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:30:32,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:32,129 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 17:30:32,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:32,130 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:32,130 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:30:32,131 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:8 [2019-12-07 17:30:32,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:30:32,208 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 17:30:32,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777512750] [2019-12-07 17:30:32,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:30:32,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 10] imperfect sequences [] total 16 [2019-12-07 17:30:32,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854915815] [2019-12-07 17:30:32,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 17:30:32,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 17:30:32,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 17:30:32,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:30:32,209 INFO L87 Difference]: Start difference. First operand 3430 states and 7760 transitions. Second operand 16 states. [2019-12-07 17:30:57,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:30:57,565 INFO L93 Difference]: Finished difference Result 6983 states and 20331 transitions. [2019-12-07 17:30:57,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 17:30:57,567 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2019-12-07 17:30:57,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:30:57,586 INFO L225 Difference]: With dead ends: 6983 [2019-12-07 17:30:57,586 INFO L226 Difference]: Without dead ends: 3564 [2019-12-07 17:30:57,599 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:30:57,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3564 states. [2019-12-07 17:30:57,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3564 to 3495. [2019-12-07 17:30:57,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3495 states. [2019-12-07 17:30:57,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3495 states to 3495 states and 7892 transitions. [2019-12-07 17:30:57,740 INFO L78 Accepts]: Start accepts. Automaton has 3495 states and 7892 transitions. Word has length 80 [2019-12-07 17:30:57,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:30:57,740 INFO L462 AbstractCegarLoop]: Abstraction has 3495 states and 7892 transitions. [2019-12-07 17:30:57,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 17:30:57,740 INFO L276 IsEmpty]: Start isEmpty. Operand 3495 states and 7892 transitions. [2019-12-07 17:30:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:30:57,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:30:57,745 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-12-07 17:30:57,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 mathsat -unsat_core_generation=3 [2019-12-07 17:30:57,946 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ASIdleErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:30:57,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:30:57,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1099686263, now seen corresponding path program 1 times [2019-12-07 17:30:57,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 17:30:57,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223804131] [2019-12-07 17:30:57,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/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 17:30:59,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:30:59,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 110 conjunts are in the unsatisfiable core [2019-12-07 17:30:59,077 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 17:30:59,091 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 17:30:59,091 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 19 treesize of output 18 [2019-12-07 17:30:59,092 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:30:59,100 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:30:59,100 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:30:59,100 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:21 [2019-12-07 17:30:59,115 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_int_307|, |v_#memory_$Pointer$.offset_273|, |v_#memory_$Pointer$.base_278|], 2=[|v_#memory_$Pointer$.offset_269|, |v_#memory_$Pointer$.base_272|, |v_#memory_$Pointer$.base_270|, |v_#memory_$Pointer$.offset_270|, |v_#memory_$Pointer$.offset_272|, |v_#memory_$Pointer$.base_269|], 6=[|v_#memory_$Pointer$.base_271|, |v_#memory_$Pointer$.offset_271|]} [2019-12-07 17:30:59,375 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:30:59,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:30:59,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:30:59,835 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:30:59,885 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:00,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:00,182 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:00,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:00,717 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:00,813 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:00,813 INFO L237 Elim1Store]: Index analysis took 1513 ms [2019-12-07 17:31:00,815 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 14 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 56 [2019-12-07 17:31:00,815 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:10,556 WARN L192 SmtUtils]: Spent 9.74 s on a formula simplification. DAG size of input: 113 DAG size of output: 111 [2019-12-07 17:31:10,557 INFO L614 ElimStorePlain]: treesize reduction 4, result has 98.8 percent of original size [2019-12-07 17:31:10,782 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:10,961 INFO L237 Elim1Store]: Index analysis took 227 ms [2019-12-07 17:31:11,284 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 24 treesize of output 9 [2019-12-07 17:31:11,284 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:14,137 WARN L192 SmtUtils]: Spent 2.85 s on a formula simplification that was a NOOP. DAG size: 105 [2019-12-07 17:31:14,137 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:14,398 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:14,757 INFO L237 Elim1Store]: Index analysis took 437 ms [2019-12-07 17:31:15,207 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 24 treesize of output 9 [2019-12-07 17:31:15,207 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:18,506 WARN L192 SmtUtils]: Spent 3.30 s on a formula simplification that was a NOOP. DAG size: 99 [2019-12-07 17:31:18,506 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:18,546 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 17:31:20,682 WARN L192 SmtUtils]: Spent 2.14 s on a formula simplification that was a NOOP. DAG size: 95 [2019-12-07 17:31:20,683 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:20,714 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:31:22,136 WARN L192 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 91 [2019-12-07 17:31:22,136 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:22,148 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:31:23,912 WARN L192 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 88 [2019-12-07 17:31:23,912 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:23,928 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:31:26,883 WARN L192 SmtUtils]: Spent 2.95 s on a formula simplification that was a NOOP. DAG size: 85 [2019-12-07 17:31:26,883 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:26,901 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:31:28,394 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 81 [2019-12-07 17:31:28,395 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:28,409 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:31:29,139 WARN L192 SmtUtils]: Spent 729.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-12-07 17:31:29,139 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:29,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,151 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:31:29,172 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:29,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 145 [2019-12-07 17:31:29,172 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:29,657 WARN L192 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-12-07 17:31:29,657 INFO L614 ElimStorePlain]: treesize reduction 42, result has 83.3 percent of original size [2019-12-07 17:31:29,665 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,668 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,669 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:29,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:46,089 WARN L192 SmtUtils]: Spent 16.42 s on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-12-07 17:31:46,089 INFO L343 Elim1Store]: treesize reduction 71, result has 71.4 percent of original size [2019-12-07 17:31:46,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 135 treesize of output 231 [2019-12-07 17:31:46,090 INFO L534 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:46,226 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 66 [2019-12-07 17:31:46,226 INFO L614 ElimStorePlain]: treesize reduction 154, result has 47.4 percent of original size [2019-12-07 17:31:46,227 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 11 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:31:46,227 INFO L239 ElimStorePlain]: Needed 12 recursive calls to eliminate 12 variables, input treesize:389, output treesize:80 [2019-12-07 17:31:46,307 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:46,347 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:46,347 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 4 case distinctions, treesize of input 32 treesize of output 103 [2019-12-07 17:31:46,348 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:46,720 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-12-07 17:31:46,720 INFO L614 ElimStorePlain]: treesize reduction 46, result has 75.4 percent of original size [2019-12-07 17:31:46,722 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_279|, |v_#memory_$Pointer$.offset_274|], 30=[|v_#memory_int_308|]} [2019-12-07 17:31:46,729 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 50 treesize of output 26 [2019-12-07 17:31:46,730 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:46,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:46,823 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 25 treesize of output 13 [2019-12-07 17:31:46,823 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:46,873 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:46,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:46,881 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:46,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:46,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:46,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:46,884 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:46,885 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:31:46,892 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:46,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 86 [2019-12-07 17:31:46,893 INFO L534 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:46,967 INFO L614 ElimStorePlain]: treesize reduction 28, result has 78.9 percent of original size [2019-12-07 17:31:46,967 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 17:31:46,967 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:137, output treesize:105 [2019-12-07 17:31:47,472 INFO L430 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_280|, |v_#memory_$Pointer$.offset_275|], 40=[|v_#memory_int_309|]} [2019-12-07 17:31:47,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:47,491 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 52 treesize of output 28 [2019-12-07 17:31:47,491 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:47,625 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2019-12-07 17:31:47,625 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:47,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:47,638 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 25 treesize of output 13 [2019-12-07 17:31:47,638 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:47,711 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:47,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:47,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:47,743 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:47,745 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:47,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:47,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:47,748 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:31:47,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:47,783 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 70 treesize of output 115 [2019-12-07 17:31:47,784 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:47,881 INFO L614 ElimStorePlain]: treesize reduction 40, result has 73.0 percent of original size [2019-12-07 17:31:47,881 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 17:31:47,882 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:147, output treesize:101 [2019-12-07 17:31:47,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:48,002 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:48,003 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 32 treesize of output 100 [2019-12-07 17:31:48,003 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:48,123 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-12-07 17:31:48,123 INFO L614 ElimStorePlain]: treesize reduction 60, result has 68.1 percent of original size [2019-12-07 17:31:48,124 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 28=[|#memory_int|]} [2019-12-07 17:31:48,133 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 31 treesize of output 19 [2019-12-07 17:31:48,134 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:48,173 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:48,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:48,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:48,181 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 17:31:48,182 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:31:48,188 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:48,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 37 [2019-12-07 17:31:48,189 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:48,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:48,212 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:31:48,212 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:133, output treesize:60 [2019-12-07 17:31:48,284 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 17:31:48,284 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 17:31:48,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:31:48,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:31:48,366 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 30 treesize of output 26 [2019-12-07 17:31:48,366 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 17:31:48,376 INFO L614 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-12-07 17:31:48,376 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:31:48,376 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-12-07 17:31:48,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:48,448 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:48,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:48,453 INFO L502 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_289| vanished before elimination [2019-12-07 17:31:48,453 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:31:48,453 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:109, output treesize:7 [2019-12-07 17:31:48,455 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_300|], 2=[|v_#memory_$Pointer$.base_273|, |v_#memory_$Pointer$.base_276|, |v_#memory_$Pointer$.base_275|, |v_#memory_$Pointer$.base_274|]} [2019-12-07 17:31:48,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:48,488 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:48,800 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2019-12-07 17:31:48,801 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:48,812 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:31:48,818 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 17:31:49,043 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-12-07 17:31:49,044 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:49,050 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:31:49,057 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:31:49,161 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 17:31:49,162 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:49,167 INFO L534 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:49,169 INFO L534 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:49,193 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:49,195 INFO L534 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:49,197 INFO L534 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:49,201 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:49,201 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-12-07 17:31:49,201 INFO L239 ElimStorePlain]: Needed 11 recursive calls to eliminate 7 variables, input treesize:193, output treesize:7 [2019-12-07 17:31:49,532 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:49,534 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:31:49,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:49,552 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 2 xjuncts. [2019-12-07 17:31:49,552 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:59, output treesize:27 [2019-12-07 17:31:49,750 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:31:49,778 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:49,779 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:31:49,794 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:49,794 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 17:31:49,794 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:74, output treesize:48 [2019-12-07 17:31:51,930 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 39 [2019-12-07 17:31:54,038 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 41 [2019-12-07 17:31:54,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:31:56,141 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 17:31:58,247 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-12-07 17:31:58,256 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:31:58,313 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:58,316 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:31:58,367 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:31:58,367 INFO L534 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-12-07 17:31:58,367 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:121, output treesize:105 [2019-12-07 17:32:00,722 INFO L430 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|v_#memory_$Pointer$.offset_269|, |v_#memory_$Pointer$.base_272|, |v_#memory_$Pointer$.base_270|, |v_#memory_$Pointer$.offset_270|, |v_#memory_$Pointer$.base_304|, |v_#memory_$Pointer$.offset_272|, |v_#memory_$Pointer$.offset_295|, |v_#memory_$Pointer$.base_269|], 6=[|v_#memory_$Pointer$.base_271|, |v_#memory_$Pointer$.offset_271|], 15=[|v_#memory_int_307|]} [2019-12-07 17:32:00,972 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:01,044 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:01,045 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 1 case distinctions, treesize of input 25 treesize of output 10 [2019-12-07 17:32:01,045 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:05,837 WARN L192 SmtUtils]: Spent 4.79 s on a formula simplification that was a NOOP. DAG size: 152 [2019-12-07 17:32:05,837 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:06,889 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:07,262 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:07,262 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 1 case distinctions, treesize of input 25 treesize of output 10 [2019-12-07 17:32:07,262 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 17:32:10,228 WARN L192 SmtUtils]: Spent 2.96 s on a formula simplification that was a NOOP. DAG size: 146 [2019-12-07 17:32:10,228 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:10,287 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:32:13,172 WARN L192 SmtUtils]: Spent 2.88 s on a formula simplification that was a NOOP. DAG size: 141 [2019-12-07 17:32:13,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:13,226 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 17:32:15,607 WARN L192 SmtUtils]: Spent 2.38 s on a formula simplification that was a NOOP. DAG size: 136 [2019-12-07 17:32:15,608 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:15,671 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:32:17,433 WARN L192 SmtUtils]: Spent 1.76 s on a formula simplification that was a NOOP. DAG size: 132 [2019-12-07 17:32:17,434 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:17,508 INFO L534 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:32:19,097 WARN L192 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 128 [2019-12-07 17:32:19,097 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:19,154 INFO L534 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:32:21,509 WARN L192 SmtUtils]: Spent 2.35 s on a formula simplification that was a NOOP. DAG size: 124 [2019-12-07 17:32:21,510 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:21,548 INFO L534 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:32:22,644 WARN L192 SmtUtils]: Spent 1.10 s on a formula simplification that was a NOOP. DAG size: 119 [2019-12-07 17:32:22,644 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:22,661 INFO L534 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:32:24,246 WARN L192 SmtUtils]: Spent 1.59 s on a formula simplification that was a NOOP. DAG size: 115 [2019-12-07 17:32:24,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:24,254 INFO L534 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 17:32:25,648 WARN L192 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 110 [2019-12-07 17:32:25,648 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:25,654 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:25,655 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:25,655 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:25,657 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:25,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:25,658 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:46,410 WARN L192 SmtUtils]: Spent 20.73 s on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-12-07 17:32:46,411 INFO L343 Elim1Store]: treesize reduction 308, result has 43.7 percent of original size [2019-12-07 17:32:46,411 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 1074 treesize of output 962 [2019-12-07 17:32:46,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,519 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 17:32:46,519 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 3 case distinctions, treesize of input 758 treesize of output 766 [2019-12-07 17:32:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,695 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,703 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,704 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,709 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,711 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,713 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,714 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,719 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,749 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,759 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,763 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-12-07 17:32:46,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 17:32:46,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 17:32:46,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,817 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-12-07 17:32:46,824 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:46,825 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:46,826 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:46,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:46,827 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:46,828 INFO L172 IndexEqualityManager]: detected equality via solver [2019-12-07 17:32:46,829 INFO L430 ElimStorePlain]: Different costs {0=[v_arrayElimCell_74, v_arrayElimCell_75], 1=[v_arrayElimCell_73]} [2019-12-07 17:32:46,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223804131] [2019-12-07 17:32:46,850 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4269072e [2019-12-07 17:32:46,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [503598163] [2019-12-07 17:32:46,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/cvc4 Starting monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 17:32:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:47,640 INFO L264 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 48 conjunts are in the unsatisfiable core [2019-12-07 17:32:47,641 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4269072e [2019-12-07 17:32:47,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717950021] [2019-12-07 17:32:47,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_02776674-ce41-43c6-a12a-5e5d2a9c1604/bin/uautomizer/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 17:32:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:32:47,890 INFO L264 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 149 conjunts are in the unsatisfiable core [2019-12-07 17:32:47,890 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.IncrementalPlicationChecker@4269072e [2019-12-07 17:32:47,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:32:47,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2019-12-07 17:32:47,890 ERROR L206 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2019-12-07 17:32:47,890 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:32:48,494 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,31 mathsat -unsat_core_generation=3,32 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-12-07 17:32:48,516 WARN L229 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2019-12-07 17:32:48,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:32:48 BoogieIcfgContainer [2019-12-07 17:32:48,516 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:32:48,516 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:32:48,517 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:32:48,517 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:32:48,517 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:24:02" (3/4) ... [2019-12-07 17:32:48,519 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 17:32:48,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:32:48,520 INFO L168 Benchmark]: Toolchain (without parser) took 532238.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 945.7 MB in the beginning and 928.0 MB in the end (delta: 17.7 MB). Peak memory consumption was 149.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:48,520 INFO L168 Benchmark]: CDTParser took 0.15 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 17:32:48,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -130.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:48,520 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.13 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:48,521 INFO L168 Benchmark]: Boogie Preprocessor took 40.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:32:48,521 INFO L168 Benchmark]: RCFGBuilder took 5209.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 992.3 MB in the end (delta: 77.1 MB). Peak memory consumption was 77.1 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:48,521 INFO L168 Benchmark]: TraceAbstraction took 526504.61 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 12.1 MB). Free memory was 992.3 MB in the beginning and 928.0 MB in the end (delta: 64.3 MB). Peak memory consumption was 76.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:32:48,521 INFO L168 Benchmark]: Witness Printer took 2.55 ms. Allocated memory is still 1.2 GB. Free memory is still 928.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:32:48,522 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 431.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -130.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.13 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 5209.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 992.3 MB in the end (delta: 77.1 MB). Peak memory consumption was 77.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 526504.61 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 12.1 MB). Free memory was 992.3 MB in the beginning and 928.0 MB in the end (delta: 64.3 MB). Peak memory consumption was 76.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.55 ms. Allocated memory is still 1.2 GB. Free memory is still 928.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 919]: 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: [L768] user_t *user; [L964] user = malloc(sizeof(user_t)) [L955] user->info = calloc(1, sizeof(info_t)) [L956] user->message.id = 11 [L957] EXPR user->info [L957] user->info->is_valid = 0 [L958] user->status = AS_NULL [L959] user->user_id = 11 [L960] user->timeout = 3 [L966] event_t e = {0}; [L967] e.primitive = _EVENT_START [L968] CALL event_precess(&e) [L932] EXPR user->status [L932] sys_state_t status = user->status; [L933] int rc = -1; [L934] COND TRUE status < AS_STATE_MAX [L936] case AS_NULL: [L937] CALL ASNull(e) [L827] EXPR e->primitive [L827] e_primitive_t primitive = e->primitive; [L828] COND TRUE primitive == _EVENT_START [L803] COND TRUE status < AS_STATE_MAX [L804] EXPR user->status [L804] COND TRUE user->status != status [L805] user->status = status [L806] return 10; [L830] CALL system_initialize() [L818] event_t e = {0}; [L819] EXPR user->info [L819] EXPR user->info->is_valid [L819] COND FALSE !(!user->info->is_valid) [L822] e.primitive = _EVENT_OPEN [L824] CALL event_precess(&e) [L932] EXPR user->status [L932] sys_state_t status = user->status; [L933] int rc = -1; [L934] COND TRUE status < AS_STATE_MAX [L936] case AS_NULL: [L939] case AS_START: [L940] CALL ASStart(e) [L870] EXPR e->primitive [L870] e_primitive_t primitive = e->primitive; [L871] int rc = -1; [L873] case _EVENT_OPEN: [L874] message_t *message = &user->message; [L875] message = calloc(0,sizeof(*message)) [L876] message->id = 4 [L877] message->type = M_OPEN [L858] message->index = 3 [L859] message->time = 2 [L860] message->data.length = 15 [L861] message->data.length [L879] CALL, EXPR message_send() [L771] message_t* message = &user->message; [L772] message->type [L773] case M_HELLO: [L774] EXPR user->info [L774] EXPR message->u.hello.data.value[0] [L774] user->info->identifies.identify[0].id1 = message->u.hello.data.value[0] [L775] EXPR user->info [L775] EXPR message->u.hello.data.value[1] [L775] user->info->identifies.identify[0].id2 = message->u.hello.data.value[1] [L776] EXPR user->info [L776] EXPR message->u.hello.data.value[2] [L776] user->info->identifies.identify[0].id3 = message->u.hello.data.value[2] [L777] EXPR user->info [L777] EXPR message->u.hello.data.value[3] [L777] user->info->identifies.identify[0].id4 = message->u.hello.data.value[3] [L792] EXPR user->timeout [L792] user->timeout-- [L793] EXPR user->timeout [L793] COND FALSE !(user->timeout <= 0) [L798] return 0; [L879] RET, EXPR message_send() [L879] rc = message_send() [L880] COND TRUE rc == 0 [L803] COND TRUE status < AS_STATE_MAX [L804] EXPR user->status [L804] COND TRUE user->status != status [L805] user->status = status [L806] return 10; [L882] e->primitive = _EVENT_HELLO [L884] CALL event_precess(e) [L932] EXPR user->status [L932] sys_state_t status = user->status; [L933] int rc = -1; [L934] COND TRUE status < AS_STATE_MAX [L936] case AS_NULL: [L939] case AS_START: [L942] case AS_IDLE: [L943] CALL ASIdle(e) [L906] EXPR e->primitive [L906] e_primitive_t primitive = e->primitive; [L907] int rc = 0; [L909] case _EVENT_HELLO: [L910] message_t *message = &user->message; [L911] message = calloc(0,sizeof(*message)) [L912] message->id = 4 [L913] message->type = M_HELLO [L852] message->index = 2 [L853] message->operations = 2 [L854] message->data.length = 15 [L915] CALL, EXPR message_send() [L771] message_t* message = &user->message; [L772] message->type [L773] case M_HELLO: [L774] EXPR user->info [L774] EXPR message->u.hello.data.value[0] [L774] user->info->identifies.identify[0].id1 = message->u.hello.data.value[0] [L775] EXPR user->info [L775] EXPR message->u.hello.data.value[1] [L775] user->info->identifies.identify[0].id2 = message->u.hello.data.value[1] [L776] EXPR user->info [L776] EXPR message->u.hello.data.value[2] [L776] user->info->identifies.identify[0].id3 = message->u.hello.data.value[2] [L777] EXPR user->info [L777] EXPR message->u.hello.data.value[3] [L777] user->info->identifies.identify[0].id4 = message->u.hello.data.value[3] [L792] EXPR user->timeout [L792] user->timeout-- [L793] EXPR user->timeout [L793] COND FALSE !(user->timeout <= 0) [L798] return 0; [L915] RET, EXPR message_send() [L915] rc = message_send() [L916] CALL event_precess(e) [L932] EXPR user->status [L932] sys_state_t status = user->status; [L933] int rc = -1; [L934] COND TRUE status < AS_STATE_MAX [L936] case AS_NULL: [L939] case AS_START: [L942] case AS_IDLE: [L943] CALL ASIdle(e) [L906] EXPR e->primitive [L906] e_primitive_t primitive = e->primitive; [L907] int rc = 0; [L909] case _EVENT_HELLO: [L918] case _EVENT_OPEN: [L919] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 124 locations, 1 error locations. Result: UNKNOWN, OverallTime: 526.4s, OverallIterations: 30, TraceHistogramMax: 5, AutomataDifference: 400.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5139 SDtfs, 2905 SDslu, 22408 SDs, 0 SdLazy, 8690 SolverSat, 900 SolverUnsat, 27 SolverUnknown, 0 SolverNotchecked, 390.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2550 GetRequests, 2206 SyntacticMatches, 33 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3495occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 1032 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1249 NumberOfCodeBlocks, 1249 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2440 ConstructedInterpolants, 0 QuantifiedInterpolants, 306955 SizeOfPredicates, 250 NumberOfNonLiveVariables, 7708 ConjunctsInSsa, 354 ConjunctsInUnsatCore, 58 InterpolantComputations, 51 PerfectInterpolantSequences, 678/702 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...