./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/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 64bit --witnessprinter.graph.data.programhash 3198ee11c6ed540a48e3bca51463c154c984d782 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/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 64bit --witnessprinter.graph.data.programhash 3198ee11c6ed540a48e3bca51463c154c984d782 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 11:15:28,209 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:15:28,210 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:15:28,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:15:28,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:15:28,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:15:28,231 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:15:28,240 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:15:28,245 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:15:28,250 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:15:28,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:15:28,253 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:15:28,253 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:15:28,255 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:15:28,256 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:15:28,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:15:28,259 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:15:28,259 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:15:28,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:15:28,266 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:15:28,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:15:28,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:15:28,276 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:15:28,276 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:15:28,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:15:28,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:15:28,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:15:28,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:15:28,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:15:28,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:15:28,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:15:28,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:15:28,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:15:28,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:15:28,287 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:15:28,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:15:28,288 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:15:28,288 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:15:28,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:15:28,289 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:15:28,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:15:28,291 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Default.epf [2019-11-20 11:15:28,318 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:15:28,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:15:28,330 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:15:28,330 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:15:28,330 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:15:28,331 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:15:28,331 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 11:15:28,331 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:15:28,331 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:15:28,332 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:15:28,332 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:15:28,332 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:15:28,332 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:15:28,333 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:15:28,333 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:15:28,333 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:15:28,333 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:15:28,334 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:15:28,334 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:15:28,334 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:15:28,334 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:15:28,335 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:15:28,335 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 11:15:28,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 11:15:28,336 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:15:28,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:15:28,337 INFO L138 SettingsManager]: * To the following directory=dump/ 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_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3198ee11c6ed540a48e3bca51463c154c984d782 [2019-11-20 11:15:28,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:15:28,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:15:28,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:15:28,534 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:15:28,534 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:15:28,535 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 11:15:28,591 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/data/382c80197/549e136d481d4c31b6fdd8e364f7c631/FLAGb9aa08b14 [2019-11-20 11:15:29,290 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:15:29,290 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 11:15:29,318 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/data/382c80197/549e136d481d4c31b6fdd8e364f7c631/FLAGb9aa08b14 [2019-11-20 11:15:29,607 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/data/382c80197/549e136d481d4c31b6fdd8e364f7c631 [2019-11-20 11:15:29,610 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:15:29,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:15:29,613 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:15:29,613 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:15:29,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:15:29,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:15:29" (1/1) ... [2019-11-20 11:15:29,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5271d26b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:29, skipping insertion in model container [2019-11-20 11:15:29,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:15:29" (1/1) ... [2019-11-20 11:15:29,628 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:15:29,743 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:15:30,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:15:30,826 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:15:31,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:15:31,136 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:15:31,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31 WrapperNode [2019-11-20 11:15:31,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:15:31,139 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:15:31,139 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:15:31,139 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:15:31,148 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (1/1) ... [2019-11-20 11:15:31,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (1/1) ... [2019-11-20 11:15:31,293 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:15:31,293 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:15:31,293 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:15:31,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:15:31,305 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (1/1) ... [2019-11-20 11:15:31,305 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (1/1) ... [2019-11-20 11:15:31,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (1/1) ... [2019-11-20 11:15:31,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (1/1) ... [2019-11-20 11:15:31,387 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (1/1) ... [2019-11-20 11:15:31,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (1/1) ... [2019-11-20 11:15:31,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (1/1) ... [2019-11-20 11:15:31,428 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:15:31,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:15:31,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:15:31,429 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:15:31,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:15:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 11:15:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-20 11:15:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 11:15:31,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:15:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:15:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:15:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:15:31,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 11:15:31,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-20 11:15:31,509 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:15:31,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:15:33,414 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:15:33,415 INFO L285 CfgBuilder]: Removed 174 assume(true) statements. [2019-11-20 11:15:33,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:33 BoogieIcfgContainer [2019-11-20 11:15:33,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:15:33,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:15:33,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:15:33,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:15:33,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:15:29" (1/3) ... [2019-11-20 11:15:33,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a46b78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:15:33, skipping insertion in model container [2019-11-20 11:15:33,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:31" (2/3) ... [2019-11-20 11:15:33,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a46b78b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:15:33, skipping insertion in model container [2019-11-20 11:15:33,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:33" (3/3) ... [2019-11-20 11:15:33,428 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 11:15:33,439 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:15:33,447 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-20 11:15:33,459 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-20 11:15:33,489 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:15:33,490 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:15:33,490 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:15:33,490 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:15:33,490 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:15:33,491 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:15:33,491 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:15:33,491 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:15:33,519 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-11-20 11:15:33,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 11:15:33,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:33,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:33,529 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:33,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:33,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1207106516, now seen corresponding path program 1 times [2019-11-20 11:15:33,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:33,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539042295] [2019-11-20 11:15:33,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:33,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:33,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539042295] [2019-11-20 11:15:33,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:33,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:15:33,961 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745949493] [2019-11-20 11:15:33,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:15:33,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:33,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:15:33,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:33,983 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 3 states. [2019-11-20 11:15:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:34,143 INFO L93 Difference]: Finished difference Result 436 states and 589 transitions. [2019-11-20 11:15:34,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:15:34,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-20 11:15:34,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:34,174 INFO L225 Difference]: With dead ends: 436 [2019-11-20 11:15:34,174 INFO L226 Difference]: Without dead ends: 270 [2019-11-20 11:15:34,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:34,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-11-20 11:15:34,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2019-11-20 11:15:34,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-20 11:15:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 354 transitions. [2019-11-20 11:15:34,244 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 354 transitions. Word has length 15 [2019-11-20 11:15:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:34,244 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 354 transitions. [2019-11-20 11:15:34,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:15:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 354 transitions. [2019-11-20 11:15:34,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 11:15:34,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:34,251 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:34,252 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:34,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:34,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1395054938, now seen corresponding path program 1 times [2019-11-20 11:15:34,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:34,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945396529] [2019-11-20 11:15:34,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:34,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:34,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945396529] [2019-11-20 11:15:34,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:34,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:15:34,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747673549] [2019-11-20 11:15:34,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:15:34,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:34,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:15:34,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:15:34,455 INFO L87 Difference]: Start difference. First operand 270 states and 354 transitions. Second operand 5 states. [2019-11-20 11:15:34,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:34,719 INFO L93 Difference]: Finished difference Result 689 states and 899 transitions. [2019-11-20 11:15:34,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:15:34,721 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-20 11:15:34,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:34,724 INFO L225 Difference]: With dead ends: 689 [2019-11-20 11:15:34,725 INFO L226 Difference]: Without dead ends: 424 [2019-11-20 11:15:34,732 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:15:34,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-11-20 11:15:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 273. [2019-11-20 11:15:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-20 11:15:34,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 356 transitions. [2019-11-20 11:15:34,800 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 356 transitions. Word has length 25 [2019-11-20 11:15:34,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:34,800 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 356 transitions. [2019-11-20 11:15:34,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:15:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 356 transitions. [2019-11-20 11:15:34,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 11:15:34,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:34,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:34,804 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:34,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1124845414, now seen corresponding path program 1 times [2019-11-20 11:15:34,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:34,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971462358] [2019-11-20 11:15:34,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:34,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:35,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:35,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971462358] [2019-11-20 11:15:35,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:35,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:15:35,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479483936] [2019-11-20 11:15:35,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:15:35,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:35,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:15:35,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:35,054 INFO L87 Difference]: Start difference. First operand 273 states and 356 transitions. Second operand 3 states. [2019-11-20 11:15:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:35,131 INFO L93 Difference]: Finished difference Result 807 states and 1057 transitions. [2019-11-20 11:15:35,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:15:35,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 11:15:35,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:35,136 INFO L225 Difference]: With dead ends: 807 [2019-11-20 11:15:35,137 INFO L226 Difference]: Without dead ends: 539 [2019-11-20 11:15:35,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2019-11-20 11:15:35,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 527. [2019-11-20 11:15:35,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-11-20 11:15:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 692 transitions. [2019-11-20 11:15:35,185 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 692 transitions. Word has length 25 [2019-11-20 11:15:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:35,187 INFO L462 AbstractCegarLoop]: Abstraction has 527 states and 692 transitions. [2019-11-20 11:15:35,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:15:35,187 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 692 transitions. [2019-11-20 11:15:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 11:15:35,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:35,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:35,253 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:35,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash -510462989, now seen corresponding path program 1 times [2019-11-20 11:15:35,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:35,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360553141] [2019-11-20 11:15:35,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:35,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:35,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:35,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360553141] [2019-11-20 11:15:35,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:35,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:15:35,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967494607] [2019-11-20 11:15:35,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:15:35,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:35,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:15:35,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:35,385 INFO L87 Difference]: Start difference. First operand 527 states and 692 transitions. Second operand 3 states. [2019-11-20 11:15:35,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:35,414 INFO L93 Difference]: Finished difference Result 527 states and 692 transitions. [2019-11-20 11:15:35,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:15:35,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-20 11:15:35,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:35,418 INFO L225 Difference]: With dead ends: 527 [2019-11-20 11:15:35,419 INFO L226 Difference]: Without dead ends: 525 [2019-11-20 11:15:35,419 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:35,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2019-11-20 11:15:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 525. [2019-11-20 11:15:35,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2019-11-20 11:15:35,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 690 transitions. [2019-11-20 11:15:35,458 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 690 transitions. Word has length 26 [2019-11-20 11:15:35,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:35,459 INFO L462 AbstractCegarLoop]: Abstraction has 525 states and 690 transitions. [2019-11-20 11:15:35,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:15:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 690 transitions. [2019-11-20 11:15:35,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 11:15:35,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:35,462 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:35,462 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:35,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:35,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1355523012, now seen corresponding path program 1 times [2019-11-20 11:15:35,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:35,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452376158] [2019-11-20 11:15:35,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:35,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:35,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:35,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452376158] [2019-11-20 11:15:35,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:35,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:15:35,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635556484] [2019-11-20 11:15:35,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:15:35,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:35,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:15:35,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:35,574 INFO L87 Difference]: Start difference. First operand 525 states and 690 transitions. Second operand 3 states. [2019-11-20 11:15:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:35,609 INFO L93 Difference]: Finished difference Result 525 states and 690 transitions. [2019-11-20 11:15:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:15:35,610 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 11:15:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:35,614 INFO L225 Difference]: With dead ends: 525 [2019-11-20 11:15:35,614 INFO L226 Difference]: Without dead ends: 523 [2019-11-20 11:15:35,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:35,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-20 11:15:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2019-11-20 11:15:35,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-11-20 11:15:35,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 688 transitions. [2019-11-20 11:15:35,655 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 688 transitions. Word has length 27 [2019-11-20 11:15:35,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:35,655 INFO L462 AbstractCegarLoop]: Abstraction has 523 states and 688 transitions. [2019-11-20 11:15:35,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:15:35,656 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 688 transitions. [2019-11-20 11:15:35,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 11:15:35,657 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:35,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:35,658 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:35,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:35,658 INFO L82 PathProgramCache]: Analyzing trace with hash -928453091, now seen corresponding path program 1 times [2019-11-20 11:15:35,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:35,659 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659979730] [2019-11-20 11:15:35,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:35,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:35,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659979730] [2019-11-20 11:15:35,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:35,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:15:35,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327718029] [2019-11-20 11:15:35,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:15:35,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:35,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:15:35,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:35,768 INFO L87 Difference]: Start difference. First operand 523 states and 688 transitions. Second operand 3 states. [2019-11-20 11:15:35,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:35,804 INFO L93 Difference]: Finished difference Result 523 states and 688 transitions. [2019-11-20 11:15:35,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:15:35,805 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-20 11:15:35,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:35,809 INFO L225 Difference]: With dead ends: 523 [2019-11-20 11:15:35,809 INFO L226 Difference]: Without dead ends: 521 [2019-11-20 11:15:35,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:35,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2019-11-20 11:15:35,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2019-11-20 11:15:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-11-20 11:15:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 686 transitions. [2019-11-20 11:15:35,850 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 686 transitions. Word has length 28 [2019-11-20 11:15:35,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:35,855 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 686 transitions. [2019-11-20 11:15:35,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:15:35,858 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 686 transitions. [2019-11-20 11:15:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 11:15:35,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:35,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:35,862 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:35,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:35,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1282731758, now seen corresponding path program 1 times [2019-11-20 11:15:35,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:35,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638474471] [2019-11-20 11:15:35,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:35,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:35,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638474471] [2019-11-20 11:15:35,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:35,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 11:15:35,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714048641] [2019-11-20 11:15:35,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:15:35,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:35,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:15:35,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:35,954 INFO L87 Difference]: Start difference. First operand 521 states and 686 transitions. Second operand 3 states. [2019-11-20 11:15:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:35,989 INFO L93 Difference]: Finished difference Result 521 states and 686 transitions. [2019-11-20 11:15:35,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:15:35,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-20 11:15:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:35,993 INFO L225 Difference]: With dead ends: 521 [2019-11-20 11:15:35,993 INFO L226 Difference]: Without dead ends: 512 [2019-11-20 11:15:35,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:35,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-20 11:15:36,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 512. [2019-11-20 11:15:36,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 512 states. [2019-11-20 11:15:36,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 675 transitions. [2019-11-20 11:15:36,034 INFO L78 Accepts]: Start accepts. Automaton has 512 states and 675 transitions. Word has length 29 [2019-11-20 11:15:36,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:36,035 INFO L462 AbstractCegarLoop]: Abstraction has 512 states and 675 transitions. [2019-11-20 11:15:36,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:15:36,035 INFO L276 IsEmpty]: Start isEmpty. Operand 512 states and 675 transitions. [2019-11-20 11:15:36,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 11:15:36,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:36,038 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:36,038 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:36,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:36,039 INFO L82 PathProgramCache]: Analyzing trace with hash -826876155, now seen corresponding path program 1 times [2019-11-20 11:15:36,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:36,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74454500] [2019-11-20 11:15:36,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:36,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:36,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74454500] [2019-11-20 11:15:36,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:36,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 11:15:36,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41673551] [2019-11-20 11:15:36,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:15:36,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:36,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:15:36,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:36,156 INFO L87 Difference]: Start difference. First operand 512 states and 675 transitions. Second operand 3 states. [2019-11-20 11:15:36,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:36,238 INFO L93 Difference]: Finished difference Result 1077 states and 1427 transitions. [2019-11-20 11:15:36,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:15:36,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-20 11:15:36,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:36,243 INFO L225 Difference]: With dead ends: 1077 [2019-11-20 11:15:36,243 INFO L226 Difference]: Without dead ends: 570 [2019-11-20 11:15:36,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:36,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-20 11:15:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 562. [2019-11-20 11:15:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-11-20 11:15:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 746 transitions. [2019-11-20 11:15:36,285 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 746 transitions. Word has length 81 [2019-11-20 11:15:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:36,286 INFO L462 AbstractCegarLoop]: Abstraction has 562 states and 746 transitions. [2019-11-20 11:15:36,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:15:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 746 transitions. [2019-11-20 11:15:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 11:15:36,289 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:36,290 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:36,290 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:36,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:36,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1960968302, now seen corresponding path program 1 times [2019-11-20 11:15:36,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:36,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087130674] [2019-11-20 11:15:36,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:15:36,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087130674] [2019-11-20 11:15:36,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:36,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:15:36,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97276138] [2019-11-20 11:15:36,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:15:36,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:36,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:15:36,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:15:36,430 INFO L87 Difference]: Start difference. First operand 562 states and 746 transitions. Second operand 5 states. [2019-11-20 11:15:36,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:36,568 INFO L93 Difference]: Finished difference Result 1762 states and 2358 transitions. [2019-11-20 11:15:36,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:15:36,569 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-20 11:15:36,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:36,578 INFO L225 Difference]: With dead ends: 1762 [2019-11-20 11:15:36,578 INFO L226 Difference]: Without dead ends: 1205 [2019-11-20 11:15:36,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:15:36,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2019-11-20 11:15:36,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 574. [2019-11-20 11:15:36,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-11-20 11:15:36,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 758 transitions. [2019-11-20 11:15:36,636 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 758 transitions. Word has length 89 [2019-11-20 11:15:36,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:36,637 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 758 transitions. [2019-11-20 11:15:36,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:15:36,637 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 758 transitions. [2019-11-20 11:15:36,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:15:36,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:36,639 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:36,639 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:36,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash 515083207, now seen corresponding path program 1 times [2019-11-20 11:15:36,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:36,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217853530] [2019-11-20 11:15:36,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:15:36,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217853530] [2019-11-20 11:15:36,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:36,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 11:15:36,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507280933] [2019-11-20 11:15:36,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:15:36,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:36,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:15:36,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:15:36,821 INFO L87 Difference]: Start difference. First operand 574 states and 758 transitions. Second operand 5 states. [2019-11-20 11:15:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:37,096 INFO L93 Difference]: Finished difference Result 1965 states and 2589 transitions. [2019-11-20 11:15:37,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 11:15:37,097 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-11-20 11:15:37,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:37,106 INFO L225 Difference]: With dead ends: 1965 [2019-11-20 11:15:37,106 INFO L226 Difference]: Without dead ends: 1396 [2019-11-20 11:15:37,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-20 11:15:37,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-11-20 11:15:37,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 602. [2019-11-20 11:15:37,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-11-20 11:15:37,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 786 transitions. [2019-11-20 11:15:37,186 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 786 transitions. Word has length 91 [2019-11-20 11:15:37,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:37,186 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 786 transitions. [2019-11-20 11:15:37,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:15:37,187 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 786 transitions. [2019-11-20 11:15:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:15:37,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:37,189 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:37,189 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:37,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:37,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1216147785, now seen corresponding path program 1 times [2019-11-20 11:15:37,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:37,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638694644] [2019-11-20 11:15:37,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:37,436 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:15:37,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638694644] [2019-11-20 11:15:37,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:37,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:15:37,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390373263] [2019-11-20 11:15:37,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:15:37,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:37,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:15:37,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:15:37,439 INFO L87 Difference]: Start difference. First operand 602 states and 786 transitions. Second operand 4 states. [2019-11-20 11:15:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:37,637 INFO L93 Difference]: Finished difference Result 1676 states and 2180 transitions. [2019-11-20 11:15:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:15:37,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 11:15:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:37,645 INFO L225 Difference]: With dead ends: 1676 [2019-11-20 11:15:37,645 INFO L226 Difference]: Without dead ends: 1071 [2019-11-20 11:15:37,647 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:15:37,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2019-11-20 11:15:37,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 602. [2019-11-20 11:15:37,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-11-20 11:15:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 782 transitions. [2019-11-20 11:15:37,731 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 782 transitions. Word has length 91 [2019-11-20 11:15:37,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:37,731 INFO L462 AbstractCegarLoop]: Abstraction has 602 states and 782 transitions. [2019-11-20 11:15:37,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:15:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 782 transitions. [2019-11-20 11:15:37,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:15:37,733 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:37,733 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:37,734 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:37,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash 798751179, now seen corresponding path program 1 times [2019-11-20 11:15:37,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:37,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928743900] [2019-11-20 11:15:37,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:37,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:15:38,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928743900] [2019-11-20 11:15:38,014 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:38,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 11:15:38,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312624326] [2019-11-20 11:15:38,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:15:38,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:38,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:15:38,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:15:38,016 INFO L87 Difference]: Start difference. First operand 602 states and 782 transitions. Second operand 8 states. [2019-11-20 11:15:38,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:38,714 INFO L93 Difference]: Finished difference Result 2222 states and 2886 transitions. [2019-11-20 11:15:38,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 11:15:38,715 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2019-11-20 11:15:38,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:38,725 INFO L225 Difference]: With dead ends: 2222 [2019-11-20 11:15:38,726 INFO L226 Difference]: Without dead ends: 1625 [2019-11-20 11:15:38,728 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-11-20 11:15:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1625 states. [2019-11-20 11:15:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1625 to 626. [2019-11-20 11:15:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-11-20 11:15:38,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 806 transitions. [2019-11-20 11:15:38,814 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 806 transitions. Word has length 91 [2019-11-20 11:15:38,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:38,815 INFO L462 AbstractCegarLoop]: Abstraction has 626 states and 806 transitions. [2019-11-20 11:15:38,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:15:38,815 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 806 transitions. [2019-11-20 11:15:38,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:15:38,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:38,817 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:38,817 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:38,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:38,818 INFO L82 PathProgramCache]: Analyzing trace with hash 404384393, now seen corresponding path program 1 times [2019-11-20 11:15:38,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:38,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191052141] [2019-11-20 11:15:38,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:39,062 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:15:39,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191052141] [2019-11-20 11:15:39,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:39,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 11:15:39,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528606313] [2019-11-20 11:15:39,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 11:15:39,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 11:15:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:15:39,068 INFO L87 Difference]: Start difference. First operand 626 states and 806 transitions. Second operand 7 states. [2019-11-20 11:15:39,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:39,784 INFO L93 Difference]: Finished difference Result 2688 states and 3488 transitions. [2019-11-20 11:15:39,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 11:15:39,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-11-20 11:15:39,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:39,798 INFO L225 Difference]: With dead ends: 2688 [2019-11-20 11:15:39,798 INFO L226 Difference]: Without dead ends: 2067 [2019-11-20 11:15:39,800 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-11-20 11:15:39,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-11-20 11:15:39,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 646. [2019-11-20 11:15:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-11-20 11:15:39,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 830 transitions. [2019-11-20 11:15:39,964 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 830 transitions. Word has length 91 [2019-11-20 11:15:39,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:39,965 INFO L462 AbstractCegarLoop]: Abstraction has 646 states and 830 transitions. [2019-11-20 11:15:39,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 11:15:39,965 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 830 transitions. [2019-11-20 11:15:39,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:15:39,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:39,967 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:39,967 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:39,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:39,968 INFO L82 PathProgramCache]: Analyzing trace with hash 828031115, now seen corresponding path program 1 times [2019-11-20 11:15:39,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:39,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384765365] [2019-11-20 11:15:39,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:40,100 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:15:40,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384765365] [2019-11-20 11:15:40,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:40,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:15:40,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895878253] [2019-11-20 11:15:40,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:15:40,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:40,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:15:40,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:15:40,102 INFO L87 Difference]: Start difference. First operand 646 states and 830 transitions. Second operand 4 states. [2019-11-20 11:15:40,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:40,385 INFO L93 Difference]: Finished difference Result 2398 states and 3082 transitions. [2019-11-20 11:15:40,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:15:40,385 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-20 11:15:40,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:40,395 INFO L225 Difference]: With dead ends: 2398 [2019-11-20 11:15:40,396 INFO L226 Difference]: Without dead ends: 1757 [2019-11-20 11:15:40,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:15:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-11-20 11:15:40,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 662. [2019-11-20 11:15:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-11-20 11:15:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 850 transitions. [2019-11-20 11:15:40,491 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 850 transitions. Word has length 91 [2019-11-20 11:15:40,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:40,492 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 850 transitions. [2019-11-20 11:15:40,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:15:40,492 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 850 transitions. [2019-11-20 11:15:40,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:15:40,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:40,497 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:40,497 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:40,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:40,497 INFO L82 PathProgramCache]: Analyzing trace with hash 890070729, now seen corresponding path program 1 times [2019-11-20 11:15:40,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:40,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793650090] [2019-11-20 11:15:40,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:40,884 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:15:40,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793650090] [2019-11-20 11:15:40,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:40,885 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-20 11:15:40,885 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413998300] [2019-11-20 11:15:40,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:15:40,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:15:40,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:15:40,886 INFO L87 Difference]: Start difference. First operand 662 states and 850 transitions. Second operand 8 states. [2019-11-20 11:15:42,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:42,534 INFO L93 Difference]: Finished difference Result 3066 states and 3930 transitions. [2019-11-20 11:15:42,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 11:15:42,535 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2019-11-20 11:15:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:42,549 INFO L225 Difference]: With dead ends: 3066 [2019-11-20 11:15:42,549 INFO L226 Difference]: Without dead ends: 2409 [2019-11-20 11:15:42,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=146, Invalid=360, Unknown=0, NotChecked=0, Total=506 [2019-11-20 11:15:42,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2409 states. [2019-11-20 11:15:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2409 to 656. [2019-11-20 11:15:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2019-11-20 11:15:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 838 transitions. [2019-11-20 11:15:42,745 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 838 transitions. Word has length 91 [2019-11-20 11:15:42,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:42,745 INFO L462 AbstractCegarLoop]: Abstraction has 656 states and 838 transitions. [2019-11-20 11:15:42,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:15:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 838 transitions. [2019-11-20 11:15:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 11:15:42,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:42,748 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:42,748 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:42,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:42,749 INFO L82 PathProgramCache]: Analyzing trace with hash -931829040, now seen corresponding path program 1 times [2019-11-20 11:15:42,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:42,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243920543] [2019-11-20 11:15:42,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:42,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:15:42,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243920543] [2019-11-20 11:15:42,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428944113] [2019-11-20 11:15:42,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:15:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:43,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 1441 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:15:43,438 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:15:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:15:43,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 11:15:43,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-11-20 11:15:43,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695000580] [2019-11-20 11:15:43,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:15:43,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:43,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:15:43,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:15:43,496 INFO L87 Difference]: Start difference. First operand 656 states and 838 transitions. Second operand 4 states. [2019-11-20 11:15:43,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:43,910 INFO L93 Difference]: Finished difference Result 1959 states and 2504 transitions. [2019-11-20 11:15:43,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:15:43,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-20 11:15:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:43,921 INFO L225 Difference]: With dead ends: 1959 [2019-11-20 11:15:43,921 INFO L226 Difference]: Without dead ends: 1954 [2019-11-20 11:15:43,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:15:43,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-11-20 11:15:44,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1916. [2019-11-20 11:15:44,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1916 states. [2019-11-20 11:15:44,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1916 states to 1916 states and 2460 transitions. [2019-11-20 11:15:44,271 INFO L78 Accepts]: Start accepts. Automaton has 1916 states and 2460 transitions. Word has length 107 [2019-11-20 11:15:44,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:44,272 INFO L462 AbstractCegarLoop]: Abstraction has 1916 states and 2460 transitions. [2019-11-20 11:15:44,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:15:44,272 INFO L276 IsEmpty]: Start isEmpty. Operand 1916 states and 2460 transitions. [2019-11-20 11:15:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 11:15:44,275 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:44,275 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:44,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 11:15:44,482 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:44,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:44,482 INFO L82 PathProgramCache]: Analyzing trace with hash -230764462, now seen corresponding path program 1 times [2019-11-20 11:15:44,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:44,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922636735] [2019-11-20 11:15:44,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:44,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:15:44,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922636735] [2019-11-20 11:15:44,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:44,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 11:15:44,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503456683] [2019-11-20 11:15:44,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:15:44,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 11:15:44,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:15:44,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:15:44,625 INFO L87 Difference]: Start difference. First operand 1916 states and 2460 transitions. Second operand 4 states. [2019-11-20 11:15:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:45,474 INFO L93 Difference]: Finished difference Result 6287 states and 8121 transitions. [2019-11-20 11:15:45,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:15:45,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-20 11:15:45,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:45,499 INFO L225 Difference]: With dead ends: 6287 [2019-11-20 11:15:45,499 INFO L226 Difference]: Without dead ends: 4376 [2019-11-20 11:15:45,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:15:45,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4376 states. [2019-11-20 11:15:45,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4376 to 1928. [2019-11-20 11:15:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-11-20 11:15:45,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2472 transitions. [2019-11-20 11:15:45,850 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2472 transitions. Word has length 107 [2019-11-20 11:15:45,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:45,850 INFO L462 AbstractCegarLoop]: Abstraction has 1928 states and 2472 transitions. [2019-11-20 11:15:45,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:15:45,851 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2472 transitions. [2019-11-20 11:15:45,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 11:15:45,854 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:45,854 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:45,854 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:45,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:45,855 INFO L82 PathProgramCache]: Analyzing trace with hash 392362330, now seen corresponding path program 1 times [2019-11-20 11:15:45,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 11:15:45,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6232155] [2019-11-20 11:15:45,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 11:15:46,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:46,201 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (const Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.term(WrapperScript.java:250) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1307) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1188) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.TermTransferrer.convertApplicationTerm(TermTransferrer.java:182) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:339) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:272) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:573) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:171) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:300) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:202) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:107) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-20 11:15:46,208 INFO L168 Benchmark]: Toolchain (without parser) took 16594.78 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 508.6 MB). Free memory was 946.1 MB in the beginning and 1.0 GB in the end (delta: -84.4 MB). Peak memory consumption was 424.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:15:46,217 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 11:15:46,218 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1525.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:15:46,218 INFO L168 Benchmark]: Boogie Procedure Inliner took 154.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 11:15:46,219 INFO L168 Benchmark]: Boogie Preprocessor took 135.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-20 11:15:46,219 INFO L168 Benchmark]: RCFGBuilder took 1987.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.4 MB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 11.5 GB. [2019-11-20 11:15:46,220 INFO L168 Benchmark]: TraceAbstraction took 12785.76 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 351.3 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -91.1 MB). Peak memory consumption was 260.2 MB. Max. memory is 11.5 GB. [2019-11-20 11:15:46,222 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1525.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -133.3 MB). Peak memory consumption was 37.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 154.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 135.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1987.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 939.4 MB in the end (delta: 126.8 MB). Peak memory consumption was 126.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12785.76 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 351.3 MB). Free memory was 939.4 MB in the beginning and 1.0 GB in the end (delta: -91.1 MB). Peak memory consumption was 260.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (const Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (const Int): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:478) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 11:15:48,182 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 11:15:48,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 11:15:48,196 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 11:15:48,196 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 11:15:48,197 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 11:15:48,199 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 11:15:48,201 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 11:15:48,203 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 11:15:48,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 11:15:48,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 11:15:48,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 11:15:48,207 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 11:15:48,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 11:15:48,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 11:15:48,210 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 11:15:48,211 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 11:15:48,212 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 11:15:48,214 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 11:15:48,216 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 11:15:48,218 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 11:15:48,219 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 11:15:48,220 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 11:15:48,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 11:15:48,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 11:15:48,224 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 11:15:48,224 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 11:15:48,225 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 11:15:48,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 11:15:48,227 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 11:15:48,227 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 11:15:48,228 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 11:15:48,229 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 11:15:48,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 11:15:48,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 11:15:48,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 11:15:48,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 11:15:48,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 11:15:48,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 11:15:48,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 11:15:48,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 11:15:48,235 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2019-11-20 11:15:48,250 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 11:15:48,250 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 11:15:48,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 11:15:48,252 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 11:15:48,252 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 11:15:48,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 11:15:48,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 11:15:48,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 11:15:48,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 11:15:48,253 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 11:15:48,254 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 11:15:48,254 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 11:15:48,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 11:15:48,254 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 11:15:48,255 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 11:15:48,255 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 11:15:48,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 11:15:48,256 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 11:15:48,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 11:15:48,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:15:48,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 11:15:48,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 11:15:48,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 11:15:48,257 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 11:15:48,258 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 11:15:48,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 11:15:48,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 11:15:48,258 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-11-20 11:15:48,259 INFO L138 SettingsManager]: * To the following directory=dump/ 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_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3198ee11c6ed540a48e3bca51463c154c984d782 [2019-11-20 11:15:48,595 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 11:15:48,606 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 11:15:48,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 11:15:48,611 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 11:15:48,611 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 11:15:48,612 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/../../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 11:15:48,690 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/data/4e58b1717/67880db41d924e83a461a2ea643d6379/FLAG5323395cc [2019-11-20 11:15:49,384 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 11:15:49,385 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 11:15:49,416 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/data/4e58b1717/67880db41d924e83a461a2ea643d6379/FLAG5323395cc [2019-11-20 11:15:49,534 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/data/4e58b1717/67880db41d924e83a461a2ea643d6379 [2019-11-20 11:15:49,537 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 11:15:49,539 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 11:15:49,541 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 11:15:49,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 11:15:49,545 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 11:15:49,546 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:15:49" (1/1) ... [2019-11-20 11:15:49,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11d5d66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:49, skipping insertion in model container [2019-11-20 11:15:49,550 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:15:49" (1/1) ... [2019-11-20 11:15:49,558 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 11:15:49,656 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 11:15:50,780 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:15:50,827 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 11:15:51,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 11:15:51,142 INFO L192 MainTranslator]: Completed translation [2019-11-20 11:15:51,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51 WrapperNode [2019-11-20 11:15:51,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 11:15:51,144 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 11:15:51,144 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 11:15:51,145 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 11:15:51,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (1/1) ... [2019-11-20 11:15:51,203 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (1/1) ... [2019-11-20 11:15:51,260 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 11:15:51,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 11:15:51,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 11:15:51,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 11:15:51,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (1/1) ... [2019-11-20 11:15:51,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (1/1) ... [2019-11-20 11:15:51,284 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (1/1) ... [2019-11-20 11:15:51,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (1/1) ... [2019-11-20 11:15:51,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (1/1) ... [2019-11-20 11:15:51,366 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (1/1) ... [2019-11-20 11:15:51,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (1/1) ... [2019-11-20 11:15:51,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 11:15:51,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 11:15:51,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 11:15:51,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 11:15:51,411 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 11:15:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2019-11-20 11:15:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-11-20 11:15:51,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 11:15:51,483 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2 [2019-11-20 11:15:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-20 11:15:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-20 11:15:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 11:15:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-20 11:15:51,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE8 [2019-11-20 11:15:51,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2 [2019-11-20 11:15:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 11:15:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-20 11:15:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-20 11:15:51,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2 [2019-11-20 11:15:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-11-20 11:15:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-11-20 11:15:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE8 [2019-11-20 11:15:51,488 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 11:15:51,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 11:15:55,631 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 11:15:55,632 INFO L285 CfgBuilder]: Removed 174 assume(true) statements. [2019-11-20 11:15:55,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:55 BoogieIcfgContainer [2019-11-20 11:15:55,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 11:15:55,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 11:15:55,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 11:15:55,638 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 11:15:55,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:15:49" (1/3) ... [2019-11-20 11:15:55,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657d5e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:15:55, skipping insertion in model container [2019-11-20 11:15:55,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:15:51" (2/3) ... [2019-11-20 11:15:55,639 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@657d5e20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:15:55, skipping insertion in model container [2019-11-20 11:15:55,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:15:55" (3/3) ... [2019-11-20 11:15:55,644 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-stable-a450319-1-144_2a-drivers--input--tablet--acecad.ko-entry_point_ldv-val-v0.8.cil.out.i [2019-11-20 11:15:55,654 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 11:15:55,662 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-11-20 11:15:55,673 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-11-20 11:15:55,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 11:15:55,705 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 11:15:55,705 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 11:15:55,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 11:15:55,706 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 11:15:55,706 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 11:15:55,706 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 11:15:55,706 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 11:15:55,733 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states. [2019-11-20 11:15:55,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-20 11:15:55,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:55,746 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:55,746 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:55,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:55,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1207106516, now seen corresponding path program 1 times [2019-11-20 11:15:55,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:15:55,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [763395289] [2019-11-20 11:15:55,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:15:56,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:56,260 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:15:56,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:15:56,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:56,301 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:15:56,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:56,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [763395289] [2019-11-20 11:15:56,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:56,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 11:15:56,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137872728] [2019-11-20 11:15:56,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:15:56,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:15:56,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:15:56,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:15:56,345 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 4 states. [2019-11-20 11:15:56,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:56,584 INFO L93 Difference]: Finished difference Result 558 states and 757 transitions. [2019-11-20 11:15:56,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:15:56,586 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-20 11:15:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:56,606 INFO L225 Difference]: With dead ends: 558 [2019-11-20 11:15:56,606 INFO L226 Difference]: Without dead ends: 388 [2019-11-20 11:15:56,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:15:56,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-11-20 11:15:56,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2019-11-20 11:15:56,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-20 11:15:56,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 513 transitions. [2019-11-20 11:15:56,713 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 513 transitions. Word has length 15 [2019-11-20 11:15:56,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:56,714 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 513 transitions. [2019-11-20 11:15:56,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:15:56,714 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 513 transitions. [2019-11-20 11:15:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 11:15:56,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:56,716 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:56,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:15:56,920 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1395054938, now seen corresponding path program 1 times [2019-11-20 11:15:56,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:15:56,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [83830005] [2019-11-20 11:15:56,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:15:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:57,437 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:15:57,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:15:57,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:57,454 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:15:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:57,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [83830005] [2019-11-20 11:15:57,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:57,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 11:15:57,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714911248] [2019-11-20 11:15:57,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:15:57,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:15:57,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:15:57,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:57,473 INFO L87 Difference]: Start difference. First operand 388 states and 513 transitions. Second operand 3 states. [2019-11-20 11:15:57,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:57,579 INFO L93 Difference]: Finished difference Result 418 states and 541 transitions. [2019-11-20 11:15:57,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:15:57,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-20 11:15:57,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:57,584 INFO L225 Difference]: With dead ends: 418 [2019-11-20 11:15:57,585 INFO L226 Difference]: Without dead ends: 403 [2019-11-20 11:15:57,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:15:57,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2019-11-20 11:15:57,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 388. [2019-11-20 11:15:57,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-20 11:15:57,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 512 transitions. [2019-11-20 11:15:57,646 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 512 transitions. Word has length 25 [2019-11-20 11:15:57,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:57,646 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 512 transitions. [2019-11-20 11:15:57,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:15:57,646 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 512 transitions. [2019-11-20 11:15:57,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 11:15:57,648 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:57,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:57,855 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:15:57,856 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:57,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:57,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1395114520, now seen corresponding path program 1 times [2019-11-20 11:15:57,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:15:57,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1779764156] [2019-11-20 11:15:57,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:15:58,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:58,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:15:58,285 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:15:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:58,320 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:15:58,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:58,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1779764156] [2019-11-20 11:15:58,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:58,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 11:15:58,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053696173] [2019-11-20 11:15:58,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:15:58,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:15:58,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:15:58,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:15:58,326 INFO L87 Difference]: Start difference. First operand 388 states and 512 transitions. Second operand 5 states. [2019-11-20 11:15:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:58,503 INFO L93 Difference]: Finished difference Result 1043 states and 1373 transitions. [2019-11-20 11:15:58,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:15:58,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-11-20 11:15:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:58,510 INFO L225 Difference]: With dead ends: 1043 [2019-11-20 11:15:58,510 INFO L226 Difference]: Without dead ends: 660 [2019-11-20 11:15:58,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:15:58,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-11-20 11:15:58,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 391. [2019-11-20 11:15:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 391 states. [2019-11-20 11:15:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 515 transitions. [2019-11-20 11:15:58,565 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 515 transitions. Word has length 25 [2019-11-20 11:15:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:58,565 INFO L462 AbstractCegarLoop]: Abstraction has 391 states and 515 transitions. [2019-11-20 11:15:58,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:15:58,566 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 515 transitions. [2019-11-20 11:15:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 11:15:58,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:58,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:58,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:15:58,776 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:58,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:58,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1124845414, now seen corresponding path program 1 times [2019-11-20 11:15:58,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:15:58,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2108004159] [2019-11-20 11:15:58,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:15:59,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:15:59,191 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:15:59,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:15:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:59,218 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:15:59,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:15:59,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2108004159] [2019-11-20 11:15:59,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:15:59,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 11:15:59,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034404862] [2019-11-20 11:15:59,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:15:59,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:15:59,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:15:59,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:15:59,240 INFO L87 Difference]: Start difference. First operand 391 states and 515 transitions. Second operand 4 states. [2019-11-20 11:15:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:15:59,364 INFO L93 Difference]: Finished difference Result 1161 states and 1534 transitions. [2019-11-20 11:15:59,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:15:59,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-20 11:15:59,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:15:59,370 INFO L225 Difference]: With dead ends: 1161 [2019-11-20 11:15:59,370 INFO L226 Difference]: Without dead ends: 775 [2019-11-20 11:15:59,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:15:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-11-20 11:15:59,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 763. [2019-11-20 11:15:59,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2019-11-20 11:15:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1009 transitions. [2019-11-20 11:15:59,430 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1009 transitions. Word has length 25 [2019-11-20 11:15:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:15:59,430 INFO L462 AbstractCegarLoop]: Abstraction has 763 states and 1009 transitions. [2019-11-20 11:15:59,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:15:59,431 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1009 transitions. [2019-11-20 11:15:59,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 11:15:59,432 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:15:59,432 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:15:59,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:15:59,636 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:15:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:15:59,636 INFO L82 PathProgramCache]: Analyzing trace with hash -510462989, now seen corresponding path program 1 times [2019-11-20 11:15:59,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:15:59,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [677185] [2019-11-20 11:15:59,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:00,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:16:00,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:00,067 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:00,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:00,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [677185] [2019-11-20 11:16:00,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:00,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-20 11:16:00,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256387693] [2019-11-20 11:16:00,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:16:00,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:16:00,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:16:00,091 INFO L87 Difference]: Start difference. First operand 763 states and 1009 transitions. Second operand 4 states. [2019-11-20 11:16:00,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:00,149 INFO L93 Difference]: Finished difference Result 763 states and 1009 transitions. [2019-11-20 11:16:00,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:16:00,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-11-20 11:16:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:00,159 INFO L225 Difference]: With dead ends: 763 [2019-11-20 11:16:00,159 INFO L226 Difference]: Without dead ends: 761 [2019-11-20 11:16:00,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:16:00,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 761 states. [2019-11-20 11:16:00,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 761 to 761. [2019-11-20 11:16:00,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-11-20 11:16:00,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1007 transitions. [2019-11-20 11:16:00,224 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1007 transitions. Word has length 26 [2019-11-20 11:16:00,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:00,224 INFO L462 AbstractCegarLoop]: Abstraction has 761 states and 1007 transitions. [2019-11-20 11:16:00,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:16:00,224 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1007 transitions. [2019-11-20 11:16:00,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 11:16:00,227 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:00,227 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:00,432 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:00,432 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:00,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1355523012, now seen corresponding path program 1 times [2019-11-20 11:16:00,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:00,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1601683628] [2019-11-20 11:16:00,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:00,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:16:00,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:00,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:00,813 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:00,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1601683628] [2019-11-20 11:16:00,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:00,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 11:16:00,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988629222] [2019-11-20 11:16:00,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:16:00,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:00,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:16:00,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:16:00,819 INFO L87 Difference]: Start difference. First operand 761 states and 1007 transitions. Second operand 3 states. [2019-11-20 11:16:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:00,884 INFO L93 Difference]: Finished difference Result 761 states and 1007 transitions. [2019-11-20 11:16:00,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:16:00,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-20 11:16:00,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:00,889 INFO L225 Difference]: With dead ends: 761 [2019-11-20 11:16:00,889 INFO L226 Difference]: Without dead ends: 759 [2019-11-20 11:16:00,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:16:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2019-11-20 11:16:00,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 759. [2019-11-20 11:16:00,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-11-20 11:16:00,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1005 transitions. [2019-11-20 11:16:00,968 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1005 transitions. Word has length 27 [2019-11-20 11:16:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:00,968 INFO L462 AbstractCegarLoop]: Abstraction has 759 states and 1005 transitions. [2019-11-20 11:16:00,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:16:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1005 transitions. [2019-11-20 11:16:00,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 11:16:00,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:00,970 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:01,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:01,181 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:01,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:01,181 INFO L82 PathProgramCache]: Analyzing trace with hash -928453091, now seen corresponding path program 1 times [2019-11-20 11:16:01,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:01,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1761776068] [2019-11-20 11:16:01,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:01,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:16:01,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:01,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:01,469 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:01,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1761776068] [2019-11-20 11:16:01,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:01,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 11:16:01,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457791950] [2019-11-20 11:16:01,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:16:01,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:01,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:16:01,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:16:01,477 INFO L87 Difference]: Start difference. First operand 759 states and 1005 transitions. Second operand 3 states. [2019-11-20 11:16:01,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:01,536 INFO L93 Difference]: Finished difference Result 759 states and 1005 transitions. [2019-11-20 11:16:01,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:16:01,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-20 11:16:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:01,542 INFO L225 Difference]: With dead ends: 759 [2019-11-20 11:16:01,542 INFO L226 Difference]: Without dead ends: 757 [2019-11-20 11:16:01,542 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:16:01,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2019-11-20 11:16:01,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 757. [2019-11-20 11:16:01,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-11-20 11:16:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1003 transitions. [2019-11-20 11:16:01,606 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1003 transitions. Word has length 28 [2019-11-20 11:16:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:01,607 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 1003 transitions. [2019-11-20 11:16:01,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:16:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1003 transitions. [2019-11-20 11:16:01,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 11:16:01,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:01,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:01,811 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:01,812 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1282731758, now seen corresponding path program 1 times [2019-11-20 11:16:01,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:01,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2033088422] [2019-11-20 11:16:01,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:02,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:16:02,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:02,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:02,138 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:02,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2033088422] [2019-11-20 11:16:02,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:02,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 11:16:02,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433677403] [2019-11-20 11:16:02,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:16:02,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:02,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:16:02,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:16:02,144 INFO L87 Difference]: Start difference. First operand 757 states and 1003 transitions. Second operand 3 states. [2019-11-20 11:16:02,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:02,204 INFO L93 Difference]: Finished difference Result 757 states and 1003 transitions. [2019-11-20 11:16:02,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:16:02,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-20 11:16:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:02,210 INFO L225 Difference]: With dead ends: 757 [2019-11-20 11:16:02,210 INFO L226 Difference]: Without dead ends: 748 [2019-11-20 11:16:02,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:16:02,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2019-11-20 11:16:02,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 748. [2019-11-20 11:16:02,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-11-20 11:16:02,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 992 transitions. [2019-11-20 11:16:02,273 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 992 transitions. Word has length 29 [2019-11-20 11:16:02,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:02,273 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 992 transitions. [2019-11-20 11:16:02,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:16:02,274 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 992 transitions. [2019-11-20 11:16:02,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-20 11:16:02,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:02,279 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:02,482 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:02,485 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:02,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:02,486 INFO L82 PathProgramCache]: Analyzing trace with hash -826876155, now seen corresponding path program 1 times [2019-11-20 11:16:02,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:02,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [200490738] [2019-11-20 11:16:02,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:03,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 11:16:03,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:03,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 11:16:03,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [200490738] [2019-11-20 11:16:03,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:03,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 11:16:03,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536987459] [2019-11-20 11:16:03,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 11:16:03,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:03,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 11:16:03,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:16:03,056 INFO L87 Difference]: Start difference. First operand 748 states and 992 transitions. Second operand 3 states. [2019-11-20 11:16:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:03,184 INFO L93 Difference]: Finished difference Result 1575 states and 2101 transitions. [2019-11-20 11:16:03,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 11:16:03,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-20 11:16:03,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:03,190 INFO L225 Difference]: With dead ends: 1575 [2019-11-20 11:16:03,190 INFO L226 Difference]: Without dead ends: 832 [2019-11-20 11:16:03,192 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 11:16:03,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2019-11-20 11:16:03,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 811. [2019-11-20 11:16:03,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 811 states. [2019-11-20 11:16:03,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1082 transitions. [2019-11-20 11:16:03,258 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1082 transitions. Word has length 81 [2019-11-20 11:16:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:03,258 INFO L462 AbstractCegarLoop]: Abstraction has 811 states and 1082 transitions. [2019-11-20 11:16:03,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 11:16:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1082 transitions. [2019-11-20 11:16:03,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-20 11:16:03,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:03,261 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:03,465 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:03,465 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:03,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:03,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1960968302, now seen corresponding path program 1 times [2019-11-20 11:16:03,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:03,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1559498071] [2019-11-20 11:16:03,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:04,007 INFO L255 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:16:04,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:04,053 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:04,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:04,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1559498071] [2019-11-20 11:16:04,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:04,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-20 11:16:04,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804248361] [2019-11-20 11:16:04,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 11:16:04,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:04,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 11:16:04,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:16:04,152 INFO L87 Difference]: Start difference. First operand 811 states and 1082 transitions. Second operand 5 states. [2019-11-20 11:16:04,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:04,346 INFO L93 Difference]: Finished difference Result 2493 states and 3362 transitions. [2019-11-20 11:16:04,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 11:16:04,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-20 11:16:04,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:04,358 INFO L225 Difference]: With dead ends: 2493 [2019-11-20 11:16:04,358 INFO L226 Difference]: Without dead ends: 1687 [2019-11-20 11:16:04,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:16:04,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1687 states. [2019-11-20 11:16:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1687 to 829. [2019-11-20 11:16:04,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 829 states. [2019-11-20 11:16:04,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1100 transitions. [2019-11-20 11:16:04,445 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1100 transitions. Word has length 89 [2019-11-20 11:16:04,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:04,446 INFO L462 AbstractCegarLoop]: Abstraction has 829 states and 1100 transitions. [2019-11-20 11:16:04,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 11:16:04,446 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1100 transitions. [2019-11-20 11:16:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:16:04,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:04,448 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:04,652 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:04,653 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:04,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:04,653 INFO L82 PathProgramCache]: Analyzing trace with hash 515083207, now seen corresponding path program 1 times [2019-11-20 11:16:04,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:04,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1852830341] [2019-11-20 11:16:04,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:05,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:05,146 INFO L255 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:16:05,149 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:05,188 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:05,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:05,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1852830341] [2019-11-20 11:16:05,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:05,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 11:16:05,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056714052] [2019-11-20 11:16:05,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 11:16:05,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:05,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 11:16:05,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:16:05,231 INFO L87 Difference]: Start difference. First operand 829 states and 1100 transitions. Second operand 8 states. [2019-11-20 11:16:05,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:05,998 INFO L93 Difference]: Finished difference Result 3971 states and 5255 transitions. [2019-11-20 11:16:05,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 11:16:05,999 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 91 [2019-11-20 11:16:05,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:06,019 INFO L225 Difference]: With dead ends: 3971 [2019-11-20 11:16:06,020 INFO L226 Difference]: Without dead ends: 3147 [2019-11-20 11:16:06,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2019-11-20 11:16:06,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3147 states. [2019-11-20 11:16:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3147 to 841. [2019-11-20 11:16:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-11-20 11:16:06,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1112 transitions. [2019-11-20 11:16:06,143 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1112 transitions. Word has length 91 [2019-11-20 11:16:06,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:06,144 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1112 transitions. [2019-11-20 11:16:06,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 11:16:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1112 transitions. [2019-11-20 11:16:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:16:06,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:06,152 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:06,356 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:06,356 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:06,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:06,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1216147785, now seen corresponding path program 1 times [2019-11-20 11:16:06,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:06,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1003522917] [2019-11-20 11:16:06,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:06,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 596 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:16:06,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:07,034 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:07,034 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:07,108 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:07,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1003522917] [2019-11-20 11:16:07,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:07,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 11:16:07,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476160026] [2019-11-20 11:16:07,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:16:07,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:07,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:16:07,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:16:07,111 INFO L87 Difference]: Start difference. First operand 841 states and 1112 transitions. Second operand 6 states. [2019-11-20 11:16:07,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:07,404 INFO L93 Difference]: Finished difference Result 2333 states and 3074 transitions. [2019-11-20 11:16:07,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 11:16:07,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-20 11:16:07,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:07,414 INFO L225 Difference]: With dead ends: 2333 [2019-11-20 11:16:07,414 INFO L226 Difference]: Without dead ends: 1485 [2019-11-20 11:16:07,416 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:16:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2019-11-20 11:16:07,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 841. [2019-11-20 11:16:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 841 states. [2019-11-20 11:16:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 841 states to 841 states and 1106 transitions. [2019-11-20 11:16:07,521 INFO L78 Accepts]: Start accepts. Automaton has 841 states and 1106 transitions. Word has length 91 [2019-11-20 11:16:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:07,522 INFO L462 AbstractCegarLoop]: Abstraction has 841 states and 1106 transitions. [2019-11-20 11:16:07,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:16:07,522 INFO L276 IsEmpty]: Start isEmpty. Operand 841 states and 1106 transitions. [2019-11-20 11:16:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:16:07,524 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:07,524 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:07,728 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:07,728 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:07,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash 798751179, now seen corresponding path program 1 times [2019-11-20 11:16:07,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:07,730 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1129599063] [2019-11-20 11:16:07,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:08,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:08,241 INFO L255 TraceCheckSpWp]: Trace formula consists of 607 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 11:16:08,245 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:08,355 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:08,641 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:08,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1129599063] [2019-11-20 11:16:08,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:08,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 11:16:08,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93926322] [2019-11-20 11:16:08,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 11:16:08,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:08,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 11:16:08,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:16:08,644 INFO L87 Difference]: Start difference. First operand 841 states and 1106 transitions. Second operand 12 states. [2019-11-20 11:16:13,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:13,759 INFO L93 Difference]: Finished difference Result 4291 states and 5660 transitions. [2019-11-20 11:16:13,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 11:16:13,760 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-11-20 11:16:13,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:13,778 INFO L225 Difference]: With dead ends: 4291 [2019-11-20 11:16:13,779 INFO L226 Difference]: Without dead ends: 3455 [2019-11-20 11:16:13,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=269, Unknown=0, NotChecked=0, Total=380 [2019-11-20 11:16:13,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3455 states. [2019-11-20 11:16:14,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3455 to 907. [2019-11-20 11:16:14,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-11-20 11:16:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1178 transitions. [2019-11-20 11:16:14,034 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1178 transitions. Word has length 91 [2019-11-20 11:16:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:14,035 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1178 transitions. [2019-11-20 11:16:14,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 11:16:14,035 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1178 transitions. [2019-11-20 11:16:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:16:14,037 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:14,037 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:14,241 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:14,242 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:14,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:14,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1222397901, now seen corresponding path program 1 times [2019-11-20 11:16:14,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:14,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1616428737] [2019-11-20 11:16:14,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:14,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:14,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 11:16:14,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:14,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:14,768 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:14,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1616428737] [2019-11-20 11:16:14,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:14,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 11:16:14,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362468099] [2019-11-20 11:16:14,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 11:16:14,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:14,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 11:16:14,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 11:16:14,985 INFO L87 Difference]: Start difference. First operand 907 states and 1178 transitions. Second operand 14 states. [2019-11-20 11:16:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:19,909 INFO L93 Difference]: Finished difference Result 3237 states and 4220 transitions. [2019-11-20 11:16:19,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-20 11:16:19,909 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 91 [2019-11-20 11:16:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:19,917 INFO L225 Difference]: With dead ends: 3237 [2019-11-20 11:16:19,918 INFO L226 Difference]: Without dead ends: 2335 [2019-11-20 11:16:19,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2019-11-20 11:16:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-11-20 11:16:20,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 907. [2019-11-20 11:16:20,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 907 states. [2019-11-20 11:16:20,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 907 states to 907 states and 1178 transitions. [2019-11-20 11:16:20,056 INFO L78 Accepts]: Start accepts. Automaton has 907 states and 1178 transitions. Word has length 91 [2019-11-20 11:16:20,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:20,057 INFO L462 AbstractCegarLoop]: Abstraction has 907 states and 1178 transitions. [2019-11-20 11:16:20,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 11:16:20,057 INFO L276 IsEmpty]: Start isEmpty. Operand 907 states and 1178 transitions. [2019-11-20 11:16:20,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:16:20,059 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:20,059 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:20,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:20,264 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:20,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:20,264 INFO L82 PathProgramCache]: Analyzing trace with hash 828031115, now seen corresponding path program 1 times [2019-11-20 11:16:20,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:20,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [309988596] [2019-11-20 11:16:20,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:20,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:20,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 629 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 11:16:20,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:20,874 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:20,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:20,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [309988596] [2019-11-20 11:16:20,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:20,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 11:16:20,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550053862] [2019-11-20 11:16:20,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:16:20,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:20,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:16:20,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:16:20,915 INFO L87 Difference]: Start difference. First operand 907 states and 1178 transitions. Second operand 6 states. [2019-11-20 11:16:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:21,392 INFO L93 Difference]: Finished difference Result 4555 states and 5906 transitions. [2019-11-20 11:16:21,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:16:21,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-20 11:16:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:21,407 INFO L225 Difference]: With dead ends: 4555 [2019-11-20 11:16:21,408 INFO L226 Difference]: Without dead ends: 3653 [2019-11-20 11:16:21,410 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-20 11:16:21,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3653 states. [2019-11-20 11:16:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3653 to 931. [2019-11-20 11:16:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-11-20 11:16:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1208 transitions. [2019-11-20 11:16:21,595 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1208 transitions. Word has length 91 [2019-11-20 11:16:21,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:21,595 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1208 transitions. [2019-11-20 11:16:21,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:16:21,596 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1208 transitions. [2019-11-20 11:16:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-20 11:16:21,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:21,598 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:21,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:21,802 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:21,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:21,802 INFO L82 PathProgramCache]: Analyzing trace with hash 890070729, now seen corresponding path program 1 times [2019-11-20 11:16:21,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:21,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1056230689] [2019-11-20 11:16:21,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:22,637 INFO L255 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-20 11:16:22,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:22,738 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:22,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1056230689] [2019-11-20 11:16:22,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:22,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 6] imperfect sequences [] total 12 [2019-11-20 11:16:22,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492644071] [2019-11-20 11:16:22,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 11:16:22,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:22,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 11:16:22,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-20 11:16:22,873 INFO L87 Difference]: Start difference. First operand 931 states and 1208 transitions. Second operand 12 states. [2019-11-20 11:16:24,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:24,055 INFO L93 Difference]: Finished difference Result 2580 states and 3341 transitions. [2019-11-20 11:16:24,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 11:16:24,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-11-20 11:16:24,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:24,062 INFO L225 Difference]: With dead ends: 2580 [2019-11-20 11:16:24,062 INFO L226 Difference]: Without dead ends: 1654 [2019-11-20 11:16:24,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=117, Invalid=303, Unknown=0, NotChecked=0, Total=420 [2019-11-20 11:16:24,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2019-11-20 11:16:24,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 931. [2019-11-20 11:16:24,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-11-20 11:16:24,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1205 transitions. [2019-11-20 11:16:24,188 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1205 transitions. Word has length 91 [2019-11-20 11:16:24,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:24,188 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1205 transitions. [2019-11-20 11:16:24,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 11:16:24,189 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1205 transitions. [2019-11-20 11:16:24,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 11:16:24,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:24,191 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:24,397 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:24,398 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:24,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:24,398 INFO L82 PathProgramCache]: Analyzing trace with hash -931829040, now seen corresponding path program 1 times [2019-11-20 11:16:24,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:24,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [551162336] [2019-11-20 11:16:24,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:24,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 783 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:16:24,886 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:24,921 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:24,922 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:24,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:24,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [551162336] [2019-11-20 11:16:24,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 11:16:24,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2019-11-20 11:16:24,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986951686] [2019-11-20 11:16:24,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:16:24,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:24,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:16:24,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:16:24,963 INFO L87 Difference]: Start difference. First operand 931 states and 1205 transitions. Second operand 6 states. [2019-11-20 11:16:25,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:25,830 INFO L93 Difference]: Finished difference Result 5556 states and 7199 transitions. [2019-11-20 11:16:25,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 11:16:25,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-11-20 11:16:25,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:25,857 INFO L225 Difference]: With dead ends: 5556 [2019-11-20 11:16:25,858 INFO L226 Difference]: Without dead ends: 5551 [2019-11-20 11:16:25,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:16:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5551 states. [2019-11-20 11:16:26,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5551 to 5401. [2019-11-20 11:16:26,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5401 states. [2019-11-20 11:16:26,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5401 states to 5401 states and 7020 transitions. [2019-11-20 11:16:26,608 INFO L78 Accepts]: Start accepts. Automaton has 5401 states and 7020 transitions. Word has length 107 [2019-11-20 11:16:26,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:26,608 INFO L462 AbstractCegarLoop]: Abstraction has 5401 states and 7020 transitions. [2019-11-20 11:16:26,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:16:26,608 INFO L276 IsEmpty]: Start isEmpty. Operand 5401 states and 7020 transitions. [2019-11-20 11:16:26,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 11:16:26,613 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:26,613 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:26,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:26,817 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:26,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:26,817 INFO L82 PathProgramCache]: Analyzing trace with hash -230764462, now seen corresponding path program 1 times [2019-11-20 11:16:26,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:26,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1495462698] [2019-11-20 11:16:26,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:27,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:27,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 781 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 11:16:27,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:27,276 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:27,276 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:27,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1495462698] [2019-11-20 11:16:27,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:27,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 11:16:27,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278172398] [2019-11-20 11:16:27,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 11:16:27,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:27,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 11:16:27,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 11:16:27,286 INFO L87 Difference]: Start difference. First operand 5401 states and 7020 transitions. Second operand 4 states. [2019-11-20 11:16:28,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:28,652 INFO L93 Difference]: Finished difference Result 16581 states and 21574 transitions. [2019-11-20 11:16:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:16:28,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-11-20 11:16:28,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:28,672 INFO L225 Difference]: With dead ends: 16581 [2019-11-20 11:16:28,673 INFO L226 Difference]: Without dead ends: 11185 [2019-11-20 11:16:28,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 11:16:28,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11185 states. [2019-11-20 11:16:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11185 to 5365. [2019-11-20 11:16:29,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5365 states. [2019-11-20 11:16:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5365 states to 5365 states and 6948 transitions. [2019-11-20 11:16:29,589 INFO L78 Accepts]: Start accepts. Automaton has 5365 states and 6948 transitions. Word has length 107 [2019-11-20 11:16:29,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:29,589 INFO L462 AbstractCegarLoop]: Abstraction has 5365 states and 6948 transitions. [2019-11-20 11:16:29,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 11:16:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 5365 states and 6948 transitions. [2019-11-20 11:16:29,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 11:16:29,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:29,597 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:29,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:29,802 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:29,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:29,802 INFO L82 PathProgramCache]: Analyzing trace with hash 392362330, now seen corresponding path program 1 times [2019-11-20 11:16:29,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:29,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1323429084] [2019-11-20 11:16:29,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:16:30,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 11:16:30,839 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:16:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:30,871 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 11:16:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-20 11:16:30,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1323429084] [2019-11-20 11:16:30,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 11:16:30,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 11:16:30,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631761530] [2019-11-20 11:16:30,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 11:16:30,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 11:16:30,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 11:16:30,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 11:16:30,917 INFO L87 Difference]: Start difference. First operand 5365 states and 6948 transitions. Second operand 6 states. [2019-11-20 11:16:33,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 11:16:33,059 INFO L93 Difference]: Finished difference Result 19101 states and 24892 transitions. [2019-11-20 11:16:33,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 11:16:33,060 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-11-20 11:16:33,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 11:16:33,087 INFO L225 Difference]: With dead ends: 19101 [2019-11-20 11:16:33,088 INFO L226 Difference]: Without dead ends: 13741 [2019-11-20 11:16:33,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 11:16:33,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13741 states. [2019-11-20 11:16:34,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13741 to 7417. [2019-11-20 11:16:34,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7417 states. [2019-11-20 11:16:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7417 states to 7417 states and 9594 transitions. [2019-11-20 11:16:34,310 INFO L78 Accepts]: Start accepts. Automaton has 7417 states and 9594 transitions. Word has length 111 [2019-11-20 11:16:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 11:16:34,311 INFO L462 AbstractCegarLoop]: Abstraction has 7417 states and 9594 transitions. [2019-11-20 11:16:34,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 11:16:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 7417 states and 9594 transitions. [2019-11-20 11:16:34,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-20 11:16:34,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 11:16:34,319 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 11:16:34,526 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:16:34,526 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 11:16:34,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 11:16:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1413076004, now seen corresponding path program 1 times [2019-11-20 11:16:34,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 11:16:34,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [263873711] [2019-11-20 11:16:34,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7c7a2cb1-ff99-4d30-b7ad-d4b9c8be7780/bin/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:18:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 11:18:16,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 72 conjunts are in the unsatisfiable core [2019-11-20 11:18:16,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 11:18:16,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 5 [2019-11-20 11:18:16,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:16,256 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:16,260 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 7 treesize of output 6 [2019-11-20 11:18:16,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:16,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:16,267 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:16,268 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-11-20 11:18:16,371 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:16,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 39 [2019-11-20 11:18:16,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:16,432 INFO L567 ElimStorePlain]: treesize reduction 14, result has 66.7 percent of original size [2019-11-20 11:18:16,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-20 11:18:16,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:16,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:16,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:18:16,457 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:27 [2019-11-20 11:18:16,645 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:16,645 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 22 treesize of output 69 [2019-11-20 11:18:16,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:16,738 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-11-20 11:18:16,739 INFO L496 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-11-20 11:18:16,739 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:40 [2019-11-20 11:18:17,259 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-20 11:18:17,260 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:17,260 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 103 [2019-11-20 11:18:17,261 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:17,364 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-11-20 11:18:17,365 INFO L567 ElimStorePlain]: treesize reduction 42, result has 57.6 percent of original size [2019-11-20 11:18:17,365 INFO L496 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-11-20 11:18:17,365 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:55, output treesize:57 [2019-11-20 11:18:17,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:17,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 54 [2019-11-20 11:18:17,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:17,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:17,934 INFO L496 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-11-20 11:18:17,935 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:68, output treesize:53 [2019-11-20 11:18:22,048 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 11:18:24,173 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 11:18:26,306 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 11:18:30,439 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 11:18:32,615 WARN L191 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 11:18:34,747 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 35 [2019-11-20 11:18:34,762 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2019-11-20 11:18:34,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 1 [2019-11-20 11:18:34,777 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:34,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:34,783 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:34,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:34,825 INFO L496 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-11-20 11:18:34,825 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:53 [2019-11-20 11:18:34,849 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2019-11-20 11:18:34,866 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 1 [2019-11-20 11:18:34,866 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:34,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:34,872 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:34,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:34,911 INFO L496 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-11-20 11:18:34,911 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:53 [2019-11-20 11:18:34,914 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_83|], 6=[|v_#memory_int_92|]} [2019-11-20 11:18:34,921 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:18:34,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:34,995 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 9 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2019-11-20 11:18:35,022 INFO L343 Elim1Store]: treesize reduction 33, result has 21.4 percent of original size [2019-11-20 11:18:35,022 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 9 [2019-11-20 11:18:35,022 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:35,033 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:35,033 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:35,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:35,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:18:35,085 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:91, output treesize:37 [2019-11-20 11:18:37,197 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-20 11:18:37,209 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_85|], 6=[|v_#memory_int_93|], 50=[|v_#memory_int_84|]} [2019-11-20 11:18:37,219 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-20 11:18:37,474 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2019-11-20 11:18:37,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:37,502 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 38 [2019-11-20 11:18:37,554 INFO L343 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-20 11:18:37,554 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 7 [2019-11-20 11:18:37,554 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-20 11:18:37,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:37,566 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:18:37,692 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-20 11:18:37,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:18:37,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:18:37,706 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 71 [2019-11-20 11:19:08,186 WARN L191 SmtUtils]: Spent 30.47 s on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-11-20 11:19:08,186 INFO L343 Elim1Store]: treesize reduction 248, result has 35.2 percent of original size [2019-11-20 11:19:08,186 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 4 case distinctions, treesize of input 54 treesize of output 155 [2019-11-20 11:19:08,187 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-20 11:19:26,482 WARN L191 SmtUtils]: Spent 18.29 s on a formula simplification that was a NOOP. DAG size: 65 [2019-11-20 11:19:26,483 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:19:26,483 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-20 11:20:03,339 WARN L191 SmtUtils]: Spent 36.86 s on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-11-20 11:20:03,339 INFO L567 ElimStorePlain]: treesize reduction 8, result has 95.7 percent of original size [2019-11-20 11:20:03,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:20:03,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:20:03,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:20:03,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-20 11:20:03,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 52 dim-0 vars, and 1 xjuncts. [2019-11-20 11:20:03,463 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:237, output treesize:1818 [2019-11-20 11:20:03,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:03,474 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:21,619 WARN L191 SmtUtils]: Spent 17.13 s on a formula simplification. DAG size of input: 621 DAG size of output: 162 [2019-11-20 11:20:21,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-20 11:20:21,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:21,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:21,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:21,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:21,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:21,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:22,603 INFO L237 Elim1Store]: Index analysis took 794 ms [2019-11-20 11:20:22,676 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-20 11:20:22,677 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 134 treesize of output 190 [2019-11-20 11:20:22,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:22,678 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:22,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:22,679 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:22,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:22,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 11:20:22,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:20:22,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:20:22,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:20:23,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:20:23,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:20:23,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:20:23,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:20:23,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:20:23,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-20 11:20:24,019 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-20 11:20:24,020 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-11-20 11:20:24,023 INFO L168 Benchmark]: Toolchain (without parser) took 274484.13 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 950.9 MB in the beginning and 2.3 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-20 11:20:24,023 INFO L168 Benchmark]: CDTParser took 0.28 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-11-20 11:20:24,023 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1602.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.9 MB in the beginning and 1.1 GB in the end (delta: -101.2 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. [2019-11-20 11:20:24,024 INFO L168 Benchmark]: Boogie Procedure Inliner took 116.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 11:20:24,024 INFO L168 Benchmark]: Boogie Preprocessor took 148.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-20 11:20:24,024 INFO L168 Benchmark]: RCFGBuilder took 4224.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 913.0 MB in the end (delta: 125.1 MB). Peak memory consumption was 125.1 MB. Max. memory is 11.5 GB. [2019-11-20 11:20:24,025 INFO L168 Benchmark]: TraceAbstraction took 268387.51 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 913.0 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-20 11:20:24,026 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.28 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 1602.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.9 MB in the beginning and 1.1 GB in the end (delta: -101.2 MB). Peak memory consumption was 64.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 116.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 148.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 4224.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 913.0 MB in the end (delta: 125.1 MB). Peak memory consumption was 125.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 268387.51 ms. Allocated memory was 1.2 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 913.0 MB in the beginning and 2.3 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...