./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 70bf824eb1ce7a6b047f1b7928100a687c12a44d .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 70bf824eb1ce7a6b047f1b7928100a687c12a44d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:03:35,242 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:03:35,243 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:03:35,251 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:03:35,251 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:03:35,252 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:03:35,253 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:03:35,254 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:03:35,255 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:03:35,255 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:03:35,256 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:03:35,256 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:03:35,257 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:03:35,258 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:03:35,259 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:03:35,260 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:03:35,260 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:03:35,261 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:03:35,263 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:03:35,264 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:03:35,265 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:03:35,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:03:35,267 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:03:35,267 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:03:35,268 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:03:35,268 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:03:35,269 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:03:35,270 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:03:35,270 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:03:35,271 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:03:35,271 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:03:35,272 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:03:35,272 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:03:35,272 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:03:35,272 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:03:35,273 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:03:35,273 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:03:35,283 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:03:35,283 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:03:35,284 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:03:35,284 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:03:35,284 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:03:35,285 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:03:35,285 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:03:35,285 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:03:35,285 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:03:35,285 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:03:35,285 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:03:35,285 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:03:35,285 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:03:35,285 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:03:35,286 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:03:35,286 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:03:35,286 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:03:35,286 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:03:35,286 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:03:35,286 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:03:35,286 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:03:35,286 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:03:35,286 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:03:35,286 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:03:35,286 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:03:35,286 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:03:35,287 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:03:35,287 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:03:35,287 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:03:35,287 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:03:35,287 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 70bf824eb1ce7a6b047f1b7928100a687c12a44d [2018-11-28 13:03:35,309 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:03:35,317 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:03:35,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:03:35,321 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:03:35,321 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:03:35,321 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/../../sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.i [2018-11-28 13:03:35,361 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/data/5a74cf7da/9801e093fb9c41f49b75e77255484428/FLAG5e6a6bcb8 [2018-11-28 13:03:35,692 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:03:35,692 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.i [2018-11-28 13:03:35,698 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/data/5a74cf7da/9801e093fb9c41f49b75e77255484428/FLAG5e6a6bcb8 [2018-11-28 13:03:36,119 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/data/5a74cf7da/9801e093fb9c41f49b75e77255484428 [2018-11-28 13:03:36,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:03:36,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:03:36,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:03:36,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:03:36,125 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:03:36,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae5acfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36, skipping insertion in model container [2018-11-28 13:03:36,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,133 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:03:36,146 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:03:36,289 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:03:36,293 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:03:36,322 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:03:36,339 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:03:36,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36 WrapperNode [2018-11-28 13:03:36,339 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:03:36,340 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:03:36,340 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:03:36,340 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:03:36,392 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,400 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,407 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:03:36,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:03:36,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:03:36,407 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:03:36,414 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,416 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,417 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,427 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,433 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,434 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (1/1) ... [2018-11-28 13:03:36,436 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:03:36,437 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:03:36,437 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:03:36,437 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:03:36,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:03:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:03:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:03:36,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:03:36,479 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:03:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:03:36,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:03:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:03:36,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-11-28 13:03:36,481 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:03:36,481 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:03:36,481 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 13:03:36,481 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 13:03:36,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:03:36,714 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:03:36,714 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 13:03:36,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:36 BoogieIcfgContainer [2018-11-28 13:03:36,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:03:36,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:03:36,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:03:36,718 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:03:36,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:03:36" (1/3) ... [2018-11-28 13:03:36,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bec259c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:03:36, skipping insertion in model container [2018-11-28 13:03:36,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:03:36" (2/3) ... [2018-11-28 13:03:36,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2bec259c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:03:36, skipping insertion in model container [2018-11-28 13:03:36,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:03:36" (3/3) ... [2018-11-28 13:03:36,720 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_false-unreach-call_true-termination.i [2018-11-28 13:03:36,726 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:03:36,730 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:03:36,742 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:03:36,761 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:03:36,761 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:03:36,761 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:03:36,761 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:03:36,761 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:03:36,761 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:03:36,762 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:03:36,762 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:03:36,762 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:03:36,773 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-28 13:03:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 13:03:36,778 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:36,778 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:36,780 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:36,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:36,784 INFO L82 PathProgramCache]: Analyzing trace with hash -539958144, now seen corresponding path program 1 times [2018-11-28 13:03:36,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:36,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:36,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:36,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:36,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:36,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:36,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:03:36,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:03:36,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:03:36,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:03:36,961 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2018-11-28 13:03:37,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:37,083 INFO L93 Difference]: Finished difference Result 98 states and 149 transitions. [2018-11-28 13:03:37,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-28 13:03:37,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-28 13:03:37,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:37,090 INFO L225 Difference]: With dead ends: 98 [2018-11-28 13:03:37,090 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 13:03:37,093 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:03:37,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 13:03:37,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-11-28 13:03:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 13:03:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-28 13:03:37,121 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2018-11-28 13:03:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:37,122 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-28 13:03:37,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:03:37,122 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-28 13:03:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:03:37,123 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:37,123 INFO L402 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] [2018-11-28 13:03:37,123 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:37,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:37,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2104518782, now seen corresponding path program 1 times [2018-11-28 13:03:37,124 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:37,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:37,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:37,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:37,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:37,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:37,319 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:37,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:37,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:37,402 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:03:37,406 INFO L478 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 8 treesize of output 7 [2018-11-28 13:03:37,407 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:37,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:37,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:37,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-28 13:03:37,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 13:03:37,438 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:03:37,438 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:37,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:37,446 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:37,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 13:03:37,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:37,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:37,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2018-11-28 13:03:37,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 13:03:37,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 13:03:37,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 13:03:37,482 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 9 states. [2018-11-28 13:03:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:37,628 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2018-11-28 13:03:37,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-28 13:03:37,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-11-28 13:03:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:37,629 INFO L225 Difference]: With dead ends: 78 [2018-11-28 13:03:37,629 INFO L226 Difference]: Without dead ends: 76 [2018-11-28 13:03:37,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 21 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-28 13:03:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-28 13:03:37,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 55. [2018-11-28 13:03:37,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 13:03:37,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2018-11-28 13:03:37,636 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2018-11-28 13:03:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:37,636 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2018-11-28 13:03:37,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 13:03:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2018-11-28 13:03:37,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:03:37,636 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:37,637 INFO L402 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] [2018-11-28 13:03:37,637 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:37,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:37,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1083450428, now seen corresponding path program 1 times [2018-11-28 13:03:37,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:37,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:37,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:37,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:37,669 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:37,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:03:37,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:03:37,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:03:37,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:03:37,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:03:37,671 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 3 states. [2018-11-28 13:03:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:37,706 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2018-11-28 13:03:37,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:03:37,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 13:03:37,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:37,709 INFO L225 Difference]: With dead ends: 82 [2018-11-28 13:03:37,709 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 13:03:37,709 INFO L631 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 [2018-11-28 13:03:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 13:03:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-28 13:03:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 13:03:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-28 13:03:37,714 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 25 [2018-11-28 13:03:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:37,715 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-28 13:03:37,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:03:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-28 13:03:37,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 13:03:37,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:37,716 INFO L402 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] [2018-11-28 13:03:37,716 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:37,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:37,716 INFO L82 PathProgramCache]: Analyzing trace with hash 3338338, now seen corresponding path program 1 times [2018-11-28 13:03:37,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:37,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:37,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:37,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:37,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:37,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:37,783 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:37,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:37,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:37,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:37,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:37,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:37,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-28 13:03:37,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 13:03:37,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 13:03:37,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-28 13:03:37,856 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 8 states. [2018-11-28 13:03:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:37,954 INFO L93 Difference]: Finished difference Result 130 states and 165 transitions. [2018-11-28 13:03:37,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:03:37,954 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-11-28 13:03:37,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:37,955 INFO L225 Difference]: With dead ends: 130 [2018-11-28 13:03:37,955 INFO L226 Difference]: Without dead ends: 94 [2018-11-28 13:03:37,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:03:37,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-28 13:03:37,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2018-11-28 13:03:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 13:03:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 84 transitions. [2018-11-28 13:03:37,963 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 84 transitions. Word has length 28 [2018-11-28 13:03:37,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:37,964 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 84 transitions. [2018-11-28 13:03:37,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 13:03:37,964 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 84 transitions. [2018-11-28 13:03:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 13:03:37,965 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:37,965 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:37,966 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:37,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:37,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1687190263, now seen corresponding path program 1 times [2018-11-28 13:03:37,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:37,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:37,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:37,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:37,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:38,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:38,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:38,044 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:38,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:38,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:38,076 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:38,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:38,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:38,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 13:03:38,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:03:38,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:03:38,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:03:38,125 INFO L87 Difference]: Start difference. First operand 68 states and 84 transitions. Second operand 10 states. [2018-11-28 13:03:38,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:38,363 INFO L93 Difference]: Finished difference Result 195 states and 249 transitions. [2018-11-28 13:03:38,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:03:38,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2018-11-28 13:03:38,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:38,365 INFO L225 Difference]: With dead ends: 195 [2018-11-28 13:03:38,365 INFO L226 Difference]: Without dead ends: 165 [2018-11-28 13:03:38,366 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:03:38,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-28 13:03:38,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 87. [2018-11-28 13:03:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-28 13:03:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2018-11-28 13:03:38,381 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 28 [2018-11-28 13:03:38,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:38,381 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-28 13:03:38,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:03:38,382 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2018-11-28 13:03:38,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:03:38,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:38,383 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:38,383 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:38,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:38,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1281163029, now seen corresponding path program 1 times [2018-11-28 13:03:38,383 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:38,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:38,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:38,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:38,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:38,754 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 33 [2018-11-28 13:03:39,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:39,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:39,187 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:39,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:39,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:39,243 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 13:03:39,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,267 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,268 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-11-28 13:03:39,316 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,317 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,318 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,320 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-28 13:03:39,321 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,328 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,334 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,343 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:21 [2018-11-28 13:03:39,365 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,366 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-28 13:03:39,368 INFO L478 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 18 treesize of output 16 [2018-11-28 13:03:39,368 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,377 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:21 [2018-11-28 13:03:39,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 55 [2018-11-28 13:03:39,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,449 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-11-28 13:03:39,451 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:39,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-28 13:03:39,473 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:36 [2018-11-28 13:03:39,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,542 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2018-11-28 13:03:39,547 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2018-11-28 13:03:39,549 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 13:03:39,559 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:39,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 10 [2018-11-28 13:03:39,561 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:39,567 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:40, output treesize:3 [2018-11-28 13:03:39,598 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:39,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:39,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2018-11-28 13:03:39,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-28 13:03:39,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-28 13:03:39,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-11-28 13:03:39,614 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand 24 states. [2018-11-28 13:03:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:40,734 INFO L93 Difference]: Finished difference Result 225 states and 290 transitions. [2018-11-28 13:03:40,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-28 13:03:40,734 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-28 13:03:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:40,736 INFO L225 Difference]: With dead ends: 225 [2018-11-28 13:03:40,736 INFO L226 Difference]: Without dead ends: 223 [2018-11-28 13:03:40,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=380, Invalid=1426, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 13:03:40,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-11-28 13:03:40,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 89. [2018-11-28 13:03:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-28 13:03:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 114 transitions. [2018-11-28 13:03:40,750 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 114 transitions. Word has length 31 [2018-11-28 13:03:40,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:40,750 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 114 transitions. [2018-11-28 13:03:40,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-28 13:03:40,750 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-28 13:03:40,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:03:40,751 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:40,751 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:40,751 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:40,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:40,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1972596862, now seen corresponding path program 2 times [2018-11-28 13:03:40,752 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:40,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:40,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:40,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:40,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:40,856 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:03:40,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:40,856 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:40,862 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:03:40,886 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:03:40,886 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:03:40,888 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:40,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 13:03:40,920 INFO L478 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 12 treesize of output 11 [2018-11-28 13:03:40,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:40,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:40,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:40,927 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-28 13:03:40,965 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-28 13:03:40,966 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:40,967 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 13:03:40,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:40,970 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:40,973 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:40,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-11-28 13:03:40,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 13:03:40,985 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:03:40,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:40,987 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:40,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:40,988 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 13:03:40,998 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:03:41,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:41,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 13 [2018-11-28 13:03:41,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:03:41,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:03:41,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:03:41,014 INFO L87 Difference]: Start difference. First operand 89 states and 114 transitions. Second operand 13 states. [2018-11-28 13:03:41,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:41,229 INFO L93 Difference]: Finished difference Result 305 states and 403 transitions. [2018-11-28 13:03:41,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:03:41,230 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 31 [2018-11-28 13:03:41,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:41,230 INFO L225 Difference]: With dead ends: 305 [2018-11-28 13:03:41,230 INFO L226 Difference]: Without dead ends: 229 [2018-11-28 13:03:41,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:03:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-28 13:03:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 102. [2018-11-28 13:03:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-28 13:03:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 133 transitions. [2018-11-28 13:03:41,245 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 133 transitions. Word has length 31 [2018-11-28 13:03:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:41,246 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 133 transitions. [2018-11-28 13:03:41,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:03:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 133 transitions. [2018-11-28 13:03:41,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 13:03:41,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:41,247 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:41,247 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:41,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:41,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1698114635, now seen corresponding path program 1 times [2018-11-28 13:03:41,248 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:41,248 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:41,248 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:41,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:41,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:41,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:41,305 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:41,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:41,334 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:41,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:41,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:41,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 13:03:41,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:03:41,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:03:41,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:03:41,385 INFO L87 Difference]: Start difference. First operand 102 states and 133 transitions. Second operand 10 states. [2018-11-28 13:03:41,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:41,514 INFO L93 Difference]: Finished difference Result 223 states and 287 transitions. [2018-11-28 13:03:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-28 13:03:41,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 33 [2018-11-28 13:03:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:41,515 INFO L225 Difference]: With dead ends: 223 [2018-11-28 13:03:41,515 INFO L226 Difference]: Without dead ends: 154 [2018-11-28 13:03:41,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:03:41,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-11-28 13:03:41,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 110. [2018-11-28 13:03:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-28 13:03:41,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 140 transitions. [2018-11-28 13:03:41,528 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 140 transitions. Word has length 33 [2018-11-28 13:03:41,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:41,528 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 140 transitions. [2018-11-28 13:03:41,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:03:41,529 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 140 transitions. [2018-11-28 13:03:41,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 13:03:41,529 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:41,530 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:41,530 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:41,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:41,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1142223879, now seen corresponding path program 2 times [2018-11-28 13:03:41,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:41,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:41,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:41,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:41,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:41,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:41,574 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:41,596 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:03:41,634 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:03:41,634 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:03:41,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:41,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:41,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:41,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-11-28 13:03:41,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-28 13:03:41,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-28 13:03:41,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-28 13:03:41,678 INFO L87 Difference]: Start difference. First operand 110 states and 140 transitions. Second operand 10 states. [2018-11-28 13:03:41,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:41,801 INFO L93 Difference]: Finished difference Result 214 states and 269 transitions. [2018-11-28 13:03:41,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:03:41,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2018-11-28 13:03:41,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:41,802 INFO L225 Difference]: With dead ends: 214 [2018-11-28 13:03:41,802 INFO L226 Difference]: Without dead ends: 193 [2018-11-28 13:03:41,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:03:41,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-28 13:03:41,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 143. [2018-11-28 13:03:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-11-28 13:03:41,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 183 transitions. [2018-11-28 13:03:41,818 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 183 transitions. Word has length 34 [2018-11-28 13:03:41,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:41,818 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 183 transitions. [2018-11-28 13:03:41,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-28 13:03:41,819 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 183 transitions. [2018-11-28 13:03:41,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 13:03:41,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:41,820 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:41,820 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:41,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:41,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1647290398, now seen corresponding path program 3 times [2018-11-28 13:03:41,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:41,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:41,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:41,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:42,678 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:42,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:42,678 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:42,685 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:03:42,717 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 13:03:42,717 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:03:42,720 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:42,729 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 13:03:42,736 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,737 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-11-28 13:03:42,752 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,753 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,754 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,755 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-28 13:03:42,755 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:42,760 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:42,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:42,773 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:42,773 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:51, output treesize:30 [2018-11-28 13:03:42,792 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 38 [2018-11-28 13:03:42,794 INFO L478 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 18 treesize of output 16 [2018-11-28 13:03:42,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:42,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:42,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:42,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:30 [2018-11-28 13:03:42,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 68 [2018-11-28 13:03:42,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:42,891 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-11-28 13:03:42,892 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:42,911 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:42,919 INFO L267 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. [2018-11-28 13:03:42,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:55 [2018-11-28 13:03:42,999 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,002 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 80 [2018-11-28 13:03:43,008 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,009 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,023 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 97 [2018-11-28 13:03:43,025 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:03:43,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:03:43,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2018-11-28 13:03:43,119 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:67, output treesize:298 [2018-11-28 13:03:43,490 WARN L180 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 39 [2018-11-28 13:03:43,538 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 65 [2018-11-28 13:03:43,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,549 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:43,577 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 41 treesize of output 92 [2018-11-28 13:03:43,577 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 13:03:43,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 12 dim-0 vars, End of recursive call: 12 dim-0 vars, and 15 xjuncts. [2018-11-28 13:03:43,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2018-11-28 13:03:43,644 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-28 13:03:43,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-28 13:03:43,648 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:43,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:43,666 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:43,666 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:77, output treesize:3 [2018-11-28 13:03:43,714 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:03:43,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:43,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 30 [2018-11-28 13:03:43,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-28 13:03:43,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-28 13:03:43,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-11-28 13:03:43,736 INFO L87 Difference]: Start difference. First operand 143 states and 183 transitions. Second operand 30 states. [2018-11-28 13:03:46,673 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 91 DAG size of output: 78 [2018-11-28 13:03:49,097 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 111 DAG size of output: 82 [2018-11-28 13:03:51,489 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 80 [2018-11-28 13:03:56,566 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 64 [2018-11-28 13:03:58,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:58,134 INFO L93 Difference]: Finished difference Result 705 states and 906 transitions. [2018-11-28 13:03:58,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-11-28 13:03:58,135 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 37 [2018-11-28 13:03:58,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:58,138 INFO L225 Difference]: With dead ends: 705 [2018-11-28 13:03:58,138 INFO L226 Difference]: Without dead ends: 657 [2018-11-28 13:03:58,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3324 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1545, Invalid=9167, Unknown=0, NotChecked=0, Total=10712 [2018-11-28 13:03:58,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-11-28 13:03:58,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 184. [2018-11-28 13:03:58,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-28 13:03:58,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 244 transitions. [2018-11-28 13:03:58,175 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 244 transitions. Word has length 37 [2018-11-28 13:03:58,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:58,175 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 244 transitions. [2018-11-28 13:03:58,175 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-28 13:03:58,176 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 244 transitions. [2018-11-28 13:03:58,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 13:03:58,176 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:58,177 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:58,177 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:58,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:58,177 INFO L82 PathProgramCache]: Analyzing trace with hash 2064143268, now seen corresponding path program 3 times [2018-11-28 13:03:58,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:58,177 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:58,178 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:58,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:58,229 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 13:03:58,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:58,230 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:58,241 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:03:58,271 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 13:03:58,272 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:03:58,275 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:58,279 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 13:03:58,288 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:58,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:58,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-11-28 13:03:58,308 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:58,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:58,311 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:58,312 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:03:58,313 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-28 13:03:58,313 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:58,325 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:58,329 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:58,335 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:58,335 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2018-11-28 13:03:58,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 13:03:58,344 INFO L478 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 12 treesize of output 11 [2018-11-28 13:03:58,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:58,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:58,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:58,351 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 13:03:58,379 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 22 [2018-11-28 13:03:58,389 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 35 [2018-11-28 13:03:58,390 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-28 13:03:58,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:03:58,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:03:58,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:33 [2018-11-28 13:03:58,564 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 13:03:58,566 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:03:58,567 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 13:03:58,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:58,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:58,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:58,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:3 [2018-11-28 13:03:58,624 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 13:03:58,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:58,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 15] total 18 [2018-11-28 13:03:58,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 13:03:58,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 13:03:58,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:03:58,650 INFO L87 Difference]: Start difference. First operand 184 states and 244 transitions. Second operand 18 states. [2018-11-28 13:03:59,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:59,311 INFO L93 Difference]: Finished difference Result 406 states and 538 transitions. [2018-11-28 13:03:59,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-28 13:03:59,311 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 37 [2018-11-28 13:03:59,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:59,312 INFO L225 Difference]: With dead ends: 406 [2018-11-28 13:03:59,312 INFO L226 Difference]: Without dead ends: 264 [2018-11-28 13:03:59,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2018-11-28 13:03:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-11-28 13:03:59,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 180. [2018-11-28 13:03:59,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-28 13:03:59,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 235 transitions. [2018-11-28 13:03:59,339 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 235 transitions. Word has length 37 [2018-11-28 13:03:59,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:59,340 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 235 transitions. [2018-11-28 13:03:59,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 13:03:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 235 transitions. [2018-11-28 13:03:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 13:03:59,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:59,340 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:59,340 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:59,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:59,340 INFO L82 PathProgramCache]: Analyzing trace with hash -2011969310, now seen corresponding path program 4 times [2018-11-28 13:03:59,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:59,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:59,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:59,341 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:59,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:59,396 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:59,396 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:59,405 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 13:03:59,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 13:03:59,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:03:59,435 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:59,474 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:03:59,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:03:59,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2018-11-28 13:03:59,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:03:59,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:03:59,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:03:59,500 INFO L87 Difference]: Start difference. First operand 180 states and 235 transitions. Second operand 14 states. [2018-11-28 13:03:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:03:59,755 INFO L93 Difference]: Finished difference Result 438 states and 581 transitions. [2018-11-28 13:03:59,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-28 13:03:59,755 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-28 13:03:59,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:03:59,757 INFO L225 Difference]: With dead ends: 438 [2018-11-28 13:03:59,757 INFO L226 Difference]: Without dead ends: 417 [2018-11-28 13:03:59,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:03:59,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-11-28 13:03:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 195. [2018-11-28 13:03:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-11-28 13:03:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 255 transitions. [2018-11-28 13:03:59,781 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 255 transitions. Word has length 37 [2018-11-28 13:03:59,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:03:59,781 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 255 transitions. [2018-11-28 13:03:59,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:03:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 255 transitions. [2018-11-28 13:03:59,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 13:03:59,782 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:03:59,782 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:03:59,782 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:03:59,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:03:59,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1447053639, now seen corresponding path program 1 times [2018-11-28 13:03:59,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:03:59,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:03:59,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:59,783 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:03:59,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:03:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:59,925 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:03:59,925 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:03:59,925 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:03:59,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:03:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:03:59,948 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:03:59,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:03:59,974 INFO L478 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 10 treesize of output 9 [2018-11-28 13:03:59,974 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:03:59,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:59,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:03:59,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:13 [2018-11-28 13:04:00,000 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-11-28 13:04:00,001 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2018-11-28 13:04:00,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:00,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:00,004 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:00,005 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:3 [2018-11-28 13:04:00,026 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:04:00,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:04:00,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2018-11-28 13:04:00,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 13:04:00,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 13:04:00,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:04:00,041 INFO L87 Difference]: Start difference. First operand 195 states and 255 transitions. Second operand 18 states. [2018-11-28 13:04:00,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:04:00,455 INFO L93 Difference]: Finished difference Result 385 states and 505 transitions. [2018-11-28 13:04:00,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 13:04:00,455 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 39 [2018-11-28 13:04:00,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:04:00,456 INFO L225 Difference]: With dead ends: 385 [2018-11-28 13:04:00,456 INFO L226 Difference]: Without dead ends: 383 [2018-11-28 13:04:00,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=879, Unknown=0, NotChecked=0, Total=1056 [2018-11-28 13:04:00,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-11-28 13:04:00,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 298. [2018-11-28 13:04:00,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-11-28 13:04:00,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 388 transitions. [2018-11-28 13:04:00,518 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 388 transitions. Word has length 39 [2018-11-28 13:04:00,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:04:00,518 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 388 transitions. [2018-11-28 13:04:00,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 13:04:00,518 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 388 transitions. [2018-11-28 13:04:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 13:04:00,519 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:04:00,519 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:04:00,519 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:04:00,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:04:00,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1460763138, now seen corresponding path program 4 times [2018-11-28 13:04:00,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:04:00,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:04:00,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:04:00,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:04:00,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:04:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:04:00,566 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:04:00,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:04:00,566 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:04:00,574 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 13:04:00,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 13:04:00,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:04:00,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:04:00,655 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:04:00,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:04:00,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-28 13:04:00,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:04:00,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:04:00,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:04:00,672 INFO L87 Difference]: Start difference. First operand 298 states and 388 transitions. Second operand 13 states. [2018-11-28 13:04:01,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:04:01,063 INFO L93 Difference]: Finished difference Result 645 states and 833 transitions. [2018-11-28 13:04:01,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:04:01,064 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-28 13:04:01,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:04:01,066 INFO L225 Difference]: With dead ends: 645 [2018-11-28 13:04:01,066 INFO L226 Difference]: Without dead ends: 598 [2018-11-28 13:04:01,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2018-11-28 13:04:01,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-11-28 13:04:01,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 403. [2018-11-28 13:04:01,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-11-28 13:04:01,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 534 transitions. [2018-11-28 13:04:01,131 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 534 transitions. Word has length 40 [2018-11-28 13:04:01,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:04:01,131 INFO L480 AbstractCegarLoop]: Abstraction has 403 states and 534 transitions. [2018-11-28 13:04:01,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:04:01,131 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 534 transitions. [2018-11-28 13:04:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 13:04:01,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:04:01,132 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:04:01,132 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:04:01,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:04:01,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1132726254, now seen corresponding path program 1 times [2018-11-28 13:04:01,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:04:01,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:04:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:04:01,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:04:01,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:04:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:04:01,171 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-28 13:04:01,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:04:01,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:04:01,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 13:04:01,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 13:04:01,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:04:01,172 INFO L87 Difference]: Start difference. First operand 403 states and 534 transitions. Second operand 5 states. [2018-11-28 13:04:01,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:04:01,266 INFO L93 Difference]: Finished difference Result 671 states and 891 transitions. [2018-11-28 13:04:01,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:04:01,267 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2018-11-28 13:04:01,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:04:01,268 INFO L225 Difference]: With dead ends: 671 [2018-11-28 13:04:01,268 INFO L226 Difference]: Without dead ends: 433 [2018-11-28 13:04:01,269 INFO L631 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 [2018-11-28 13:04:01,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-11-28 13:04:01,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 398. [2018-11-28 13:04:01,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-11-28 13:04:01,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 524 transitions. [2018-11-28 13:04:01,329 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 524 transitions. Word has length 40 [2018-11-28 13:04:01,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:04:01,329 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 524 transitions. [2018-11-28 13:04:01,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 13:04:01,329 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 524 transitions. [2018-11-28 13:04:01,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 13:04:01,330 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:04:01,330 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:04:01,330 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:04:01,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:04:01,331 INFO L82 PathProgramCache]: Analyzing trace with hash 930411959, now seen corresponding path program 5 times [2018-11-28 13:04:01,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:04:01,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:04:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:04:01,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:04:01,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:04:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:04:01,399 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:04:01,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:04:01,399 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:04:01,406 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 13:04:01,446 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-28 13:04:01,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:04:01,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:04:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:04:01,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:04:01,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2018-11-28 13:04:01,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-28 13:04:01,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-28 13:04:01,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-11-28 13:04:01,511 INFO L87 Difference]: Start difference. First operand 398 states and 524 transitions. Second operand 16 states. [2018-11-28 13:04:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:04:02,027 INFO L93 Difference]: Finished difference Result 978 states and 1291 transitions. [2018-11-28 13:04:02,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-28 13:04:02,028 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2018-11-28 13:04:02,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:04:02,031 INFO L225 Difference]: With dead ends: 978 [2018-11-28 13:04:02,031 INFO L226 Difference]: Without dead ends: 921 [2018-11-28 13:04:02,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2018-11-28 13:04:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-11-28 13:04:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 443. [2018-11-28 13:04:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-11-28 13:04:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 585 transitions. [2018-11-28 13:04:02,101 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 585 transitions. Word has length 40 [2018-11-28 13:04:02,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:04:02,102 INFO L480 AbstractCegarLoop]: Abstraction has 443 states and 585 transitions. [2018-11-28 13:04:02,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-28 13:04:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 585 transitions. [2018-11-28 13:04:02,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 13:04:02,104 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:04:02,104 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:04:02,104 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:04:02,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:04:02,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1598984565, now seen corresponding path program 5 times [2018-11-28 13:04:02,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:04:02,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:04:02,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:04:02,114 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:04:02,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:04:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:04:02,473 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 48 [2018-11-28 13:04:03,500 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:04:03,500 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-28 13:04:03,500 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-28 13:04:03,506 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-28 13:04:03,764 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-28 13:04:03,765 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:04:03,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:04:03,772 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 13:04:03,778 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,783 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 38 [2018-11-28 13:04:03,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,795 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2018-11-28 13:04:03,798 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:03,803 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:03,807 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:03,817 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:03,817 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:60, output treesize:39 [2018-11-28 13:04:03,841 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 47 [2018-11-28 13:04:03,844 INFO L478 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 18 treesize of output 16 [2018-11-28 13:04:03,844 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:03,849 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:03,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:03,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:39 [2018-11-28 13:04:03,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,935 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 77 [2018-11-28 13:04:03,939 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:03,946 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 66 [2018-11-28 13:04:03,947 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:04:03,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:03,973 INFO L267 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. [2018-11-28 13:04:03,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:64 [2018-11-28 13:04:04,086 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,087 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 95 [2018-11-28 13:04:04,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,107 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 97 [2018-11-28 13:04:04,109 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:04:04,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:04:04,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 4 xjuncts. [2018-11-28 13:04:04,269 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:384 [2018-11-28 13:04:04,531 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,532 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,533 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,534 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 115 [2018-11-28 13:04:04,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:04,562 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 128 [2018-11-28 13:04:04,564 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:04:04,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2018-11-28 13:04:04,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 14 dim-0 vars, and 4 xjuncts. [2018-11-28 13:04:04,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:110, output treesize:488 [2018-11-28 13:04:08,988 WARN L180 SmtUtils]: Spent 2.17 s on a formula simplification. DAG size of input: 163 DAG size of output: 65 [2018-11-28 13:04:17,248 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 63 [2018-11-28 13:04:19,366 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 63 [2018-11-28 13:04:21,491 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 64 [2018-11-28 13:04:21,815 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:21,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:21,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 84 [2018-11-28 13:04:21,848 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 43 treesize of output 87 [2018-11-28 13:04:21,848 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-28 13:04:22,101 INFO L267 ElimStorePlain]: Start of recursive call 3: 438 dim-0 vars, End of recursive call: 462 dim-0 vars, and 477 xjuncts. [2018-11-28 13:04:26,648 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,654 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 68 [2018-11-28 13:04:26,657 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:26,662 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,664 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,674 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 70 [2018-11-28 13:04:26,675 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 3 xjuncts. [2018-11-28 13:04:26,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,678 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,680 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 64 [2018-11-28 13:04:26,685 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:04:26,689 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,691 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,692 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,695 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:04:26,701 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 70 [2018-11-28 13:04:26,702 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 3 xjuncts. [2018-11-28 13:04:26,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:26,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:04:26,740 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:114, output treesize:3 [2018-11-28 13:04:26,799 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:04:26,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:04:26,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 42 [2018-11-28 13:04:26,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-28 13:04:26,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-28 13:04:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1538, Unknown=3, NotChecked=0, Total=1722 [2018-11-28 13:04:26,816 INFO L87 Difference]: Start difference. First operand 443 states and 585 transitions. Second operand 42 states. [2018-11-28 13:04:31,892 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 102 DAG size of output: 68 [2018-11-28 13:04:35,853 WARN L180 SmtUtils]: Spent 415.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2018-11-28 13:04:38,021 WARN L180 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 80 [2018-11-28 13:04:40,659 WARN L180 SmtUtils]: Spent 2.60 s on a formula simplification. DAG size of input: 100 DAG size of output: 89 [2018-11-28 13:04:43,014 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2018-11-28 13:04:51,580 WARN L180 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 99 DAG size of output: 70 [2018-11-28 13:04:54,500 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 114 DAG size of output: 92 [2018-11-28 13:04:56,284 WARN L180 SmtUtils]: Spent 488.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 89 [2018-11-28 13:04:58,997 WARN L180 SmtUtils]: Spent 2.62 s on a formula simplification. DAG size of input: 124 DAG size of output: 72 [2018-11-28 13:05:08,764 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 127 DAG size of output: 74 [2018-11-28 13:05:10,727 WARN L180 SmtUtils]: Spent 1.90 s on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2018-11-28 13:05:15,099 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2018-11-28 13:05:18,797 WARN L180 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 137 DAG size of output: 70 [2018-11-28 13:05:19,522 WARN L180 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2018-11-28 13:05:34,263 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 125 DAG size of output: 75 [2018-11-28 13:05:38,848 WARN L180 SmtUtils]: Spent 2.47 s on a formula simplification. DAG size of input: 95 DAG size of output: 66 [2018-11-28 13:05:39,434 WARN L180 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 74 [2018-11-28 13:05:53,849 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 111 DAG size of output: 92 [2018-11-28 13:05:56,305 WARN L180 SmtUtils]: Spent 2.40 s on a formula simplification. DAG size of input: 111 DAG size of output: 93 [2018-11-28 13:05:59,342 WARN L180 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 95 DAG size of output: 87 [2018-11-28 13:06:03,473 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 134 DAG size of output: 70 [2018-11-28 13:06:15,641 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 130 DAG size of output: 72 [2018-11-28 13:06:17,935 WARN L180 SmtUtils]: Spent 2.25 s on a formula simplification. DAG size of input: 129 DAG size of output: 74 [2018-11-28 13:06:25,067 WARN L180 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2018-11-28 13:06:40,535 WARN L180 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 111 DAG size of output: 90 [2018-11-28 13:06:46,136 WARN L180 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 68 [2018-11-28 13:06:47,430 WARN L180 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 105 DAG size of output: 93 [2018-11-28 13:07:12,205 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 93 DAG size of output: 85 [2018-11-28 13:07:14,332 WARN L180 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 102 DAG size of output: 91 [2018-11-28 13:07:38,948 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2018-11-28 13:07:39,444 WARN L180 SmtUtils]: Spent 458.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 92 [2018-11-28 13:07:43,579 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 135 DAG size of output: 71 [2018-11-28 13:07:49,868 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2018-11-28 13:08:03,083 WARN L180 SmtUtils]: Spent 2.43 s on a formula simplification. DAG size of input: 106 DAG size of output: 85 [2018-11-28 13:08:13,448 WARN L180 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 122 DAG size of output: 72 [2018-11-28 13:08:21,749 WARN L180 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 92 DAG size of output: 82 [2018-11-28 13:08:32,083 WARN L180 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 120 DAG size of output: 70 [2018-11-28 13:08:38,204 WARN L180 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2018-11-28 13:08:39,288 WARN L180 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-11-28 13:08:43,676 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 94 DAG size of output: 84 [2018-11-28 13:09:01,998 WARN L180 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 130 DAG size of output: 66 [2018-11-28 13:09:14,260 WARN L180 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 127 DAG size of output: 73 [2018-11-28 13:09:14,977 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 76 [2018-11-28 13:09:28,295 WARN L180 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2018-11-28 13:09:30,721 WARN L180 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2018-11-28 13:09:43,149 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 106 DAG size of output: 86 [2018-11-28 13:09:48,864 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2018-11-28 13:09:48,865 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:102) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:651) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:255) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:270) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:94) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:202) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:715) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:628) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:472) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) 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) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 28 more [2018-11-28 13:09:48,868 INFO L168 Benchmark]: Toolchain (without parser) took 372746.85 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 371.7 MB). Free memory was 953.3 MB in the beginning and 938.7 MB in the end (delta: 14.7 MB). Peak memory consumption was 386.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:48,868 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:09:48,868 INFO L168 Benchmark]: CACSL2BoogieTranslator took 217.78 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 939.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:48,868 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:48,869 INFO L168 Benchmark]: Boogie Preprocessor took 29.58 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:48,869 INFO L168 Benchmark]: RCFGBuilder took 277.90 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:48,869 INFO L168 Benchmark]: TraceAbstraction took 372151.77 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.0 MB). Free memory was 1.1 GB in the beginning and 938.7 MB in the end (delta: 158.2 MB). Peak memory consumption was 406.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:09:48,871 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 217.78 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 939.9 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 12.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.58 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 277.90 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 372151.77 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.0 MB). Free memory was 1.1 GB in the beginning and 938.7 MB in the end (delta: 158.2 MB). Peak memory consumption was 406.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:09:50,105 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:09:50,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:09:50,115 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:09:50,115 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:09:50,116 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:09:50,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:09:50,118 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:09:50,119 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:09:50,119 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:09:50,120 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:09:50,120 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:09:50,120 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:09:50,121 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:09:50,122 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:09:50,123 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:09:50,124 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:09:50,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:09:50,126 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:09:50,127 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:09:50,128 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:09:50,129 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:09:50,131 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:09:50,131 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:09:50,131 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:09:50,132 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:09:50,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:09:50,133 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:09:50,133 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:09:50,135 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:09:50,135 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:09:50,136 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:09:50,136 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:09:50,136 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:09:50,136 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:09:50,137 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:09:50,137 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-28 13:09:50,148 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:09:50,148 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:09:50,149 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:09:50,149 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:09:50,149 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:09:50,149 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:09:50,150 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:09:50,150 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:09:50,151 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:09:50,151 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:09:50,151 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:09:50,151 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:09:50,151 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:09:50,151 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:09:50,151 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 13:09:50,151 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 13:09:50,152 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:09:50,152 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:09:50,152 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:09:50,152 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:09:50,152 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:09:50,152 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:09:50,152 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:09:50,153 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:09:50,153 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:09:50,153 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:09:50,153 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:09:50,153 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:09:50,153 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 13:09:50,153 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:09:50,153 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 13:09:50,154 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-28 13:09:50,154 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 70bf824eb1ce7a6b047f1b7928100a687c12a44d [2018-11-28 13:09:50,180 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:09:50,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:09:50,192 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:09:50,193 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:09:50,194 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:09:50,195 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/../../sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.i [2018-11-28 13:09:50,237 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/data/4b1902ebd/b8550344e3684054a6f55f02e87a6d6e/FLAG185d96151 [2018-11-28 13:09:50,632 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:09:50,633 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/sv-benchmarks/c/loops/eureka_01_false-unreach-call_true-termination.i [2018-11-28 13:09:50,638 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/data/4b1902ebd/b8550344e3684054a6f55f02e87a6d6e/FLAG185d96151 [2018-11-28 13:09:50,648 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/data/4b1902ebd/b8550344e3684054a6f55f02e87a6d6e [2018-11-28 13:09:50,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:09:50,652 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:09:50,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:09:50,653 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:09:50,655 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:09:50,655 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,657 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@776d9d29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50, skipping insertion in model container [2018-11-28 13:09:50,657 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,662 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:09:50,674 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:09:50,800 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:09:50,804 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:09:50,836 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:09:50,854 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:09:50,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50 WrapperNode [2018-11-28 13:09:50,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:09:50,855 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:09:50,855 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:09:50,855 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:09:50,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,869 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:09:50,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:09:50,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:09:50,876 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:09:50,922 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,922 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,937 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,944 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (1/1) ... [2018-11-28 13:09:50,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:09:50,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:09:50,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:09:50,947 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:09:50,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:09:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:09:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:09:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:09:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-28 13:09:50,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:09:50,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:09:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-28 13:09:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:09:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:09:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-28 13:09:50,981 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-28 13:09:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:09:50,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-28 13:09:51,239 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:09:51,240 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-28 13:09:51,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:51 BoogieIcfgContainer [2018-11-28 13:09:51,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:09:51,241 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:09:51,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:09:51,243 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:09:51,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:09:50" (1/3) ... [2018-11-28 13:09:51,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0012d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:09:51, skipping insertion in model container [2018-11-28 13:09:51,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:09:50" (2/3) ... [2018-11-28 13:09:51,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f0012d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:09:51, skipping insertion in model container [2018-11-28 13:09:51,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:51" (3/3) ... [2018-11-28 13:09:51,245 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_false-unreach-call_true-termination.i [2018-11-28 13:09:51,251 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:09:51,256 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:09:51,266 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:09:51,285 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:09:51,285 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:09:51,285 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:09:51,285 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:09:51,285 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:09:51,285 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:09:51,286 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:09:51,286 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:09:51,286 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:09:51,297 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-11-28 13:09:51,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 13:09:51,301 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:51,301 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:51,303 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:51,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:51,306 INFO L82 PathProgramCache]: Analyzing trace with hash -539958144, now seen corresponding path program 1 times [2018-11-28 13:09:51,309 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:09:51,309 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:09:51,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:51,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:51,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:51,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:51,501 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:09:51,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:51,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:09:51,508 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:09:51,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:09:51,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:09:51,521 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 6 states. [2018-11-28 13:09:51,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:51,668 INFO L93 Difference]: Finished difference Result 100 states and 151 transitions. [2018-11-28 13:09:51,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:09:51,670 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-28 13:09:51,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:51,678 INFO L225 Difference]: With dead ends: 100 [2018-11-28 13:09:51,678 INFO L226 Difference]: Without dead ends: 48 [2018-11-28 13:09:51,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:09:51,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-28 13:09:51,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-11-28 13:09:51,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-28 13:09:51,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-11-28 13:09:51,712 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 19 [2018-11-28 13:09:51,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:51,712 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-11-28 13:09:51,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:09:51,712 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-11-28 13:09:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:09:51,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:51,713 INFO L402 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] [2018-11-28 13:09:51,713 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:51,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2104518782, now seen corresponding path program 1 times [2018-11-28 13:09:51,715 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:09:51,715 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:09:51,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:51,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:51,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-28 13:09:51,877 INFO L478 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 8 treesize of output 7 [2018-11-28 13:09:51,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:51,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:51,888 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:51,889 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-28 13:09:51,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 13:09:51,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:09:51,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:51,917 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:51,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:51,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 13:09:51,940 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:51,940 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:09:52,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-28 13:09:52,039 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-28 13:09:52,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:52,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:52,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:52,043 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:5 [2018-11-28 13:09:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:52,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:52,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-28 13:09:52,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-28 13:09:52,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-28 13:09:52,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2018-11-28 13:09:52,101 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 14 states. [2018-11-28 13:09:52,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:52,529 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2018-11-28 13:09:52,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-28 13:09:52,530 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-11-28 13:09:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:52,531 INFO L225 Difference]: With dead ends: 91 [2018-11-28 13:09:52,532 INFO L226 Difference]: Without dead ends: 89 [2018-11-28 13:09:52,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:09:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-28 13:09:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 55. [2018-11-28 13:09:52,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-28 13:09:52,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2018-11-28 13:09:52,543 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 25 [2018-11-28 13:09:52,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:52,544 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2018-11-28 13:09:52,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-28 13:09:52,544 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2018-11-28 13:09:52,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-28 13:09:52,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:52,545 INFO L402 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] [2018-11-28 13:09:52,545 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:52,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:52,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1083450428, now seen corresponding path program 1 times [2018-11-28 13:09:52,545 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:09:52,546 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:09:52,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:52,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:52,604 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:52,629 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:09:52,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:09:52,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-28 13:09:52,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-28 13:09:52,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-28 13:09:52,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:52,631 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand 3 states. [2018-11-28 13:09:52,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:52,665 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2018-11-28 13:09:52,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-28 13:09:52,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-28 13:09:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:52,667 INFO L225 Difference]: With dead ends: 82 [2018-11-28 13:09:52,667 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 13:09:52,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-28 13:09:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 13:09:52,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-28 13:09:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 13:09:52,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2018-11-28 13:09:52,677 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 25 [2018-11-28 13:09:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:52,677 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2018-11-28 13:09:52,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-28 13:09:52,678 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2018-11-28 13:09:52,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 13:09:52,679 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:52,679 INFO L402 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] [2018-11-28 13:09:52,680 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:52,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:52,680 INFO L82 PathProgramCache]: Analyzing trace with hash 3338338, now seen corresponding path program 1 times [2018-11-28 13:09:52,681 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:09:52,681 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:09:52,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:52,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:52,856 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:09:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:52,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:52,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-28 13:09:52,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:09:52,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:09:52,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:09:52,922 INFO L87 Difference]: Start difference. First operand 56 states and 68 transitions. Second operand 13 states. [2018-11-28 13:09:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:53,247 INFO L93 Difference]: Finished difference Result 170 states and 224 transitions. [2018-11-28 13:09:53,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:09:53,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-28 13:09:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:53,248 INFO L225 Difference]: With dead ends: 170 [2018-11-28 13:09:53,248 INFO L226 Difference]: Without dead ends: 134 [2018-11-28 13:09:53,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2018-11-28 13:09:53,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-11-28 13:09:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 86. [2018-11-28 13:09:53,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-28 13:09:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 110 transitions. [2018-11-28 13:09:53,266 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 110 transitions. Word has length 28 [2018-11-28 13:09:53,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:53,266 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 110 transitions. [2018-11-28 13:09:53,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:09:53,267 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 110 transitions. [2018-11-28 13:09:53,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-28 13:09:53,267 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:53,267 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:53,268 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:53,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:53,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1687190263, now seen corresponding path program 1 times [2018-11-28 13:09:53,268 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:09:53,268 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:09:53,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:53,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:53,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:53,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:09:53,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:53,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:53,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-28 13:09:53,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 13:09:53,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:09:53,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:09:53,542 INFO L87 Difference]: Start difference. First operand 86 states and 110 transitions. Second operand 17 states. [2018-11-28 13:09:54,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:54,217 INFO L93 Difference]: Finished difference Result 480 states and 654 transitions. [2018-11-28 13:09:54,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 13:09:54,218 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 28 [2018-11-28 13:09:54,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:54,221 INFO L225 Difference]: With dead ends: 480 [2018-11-28 13:09:54,221 INFO L226 Difference]: Without dead ends: 411 [2018-11-28 13:09:54,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2018-11-28 13:09:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-11-28 13:09:54,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 257. [2018-11-28 13:09:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-11-28 13:09:54,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2018-11-28 13:09:54,277 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 28 [2018-11-28 13:09:54,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:54,278 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2018-11-28 13:09:54,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 13:09:54,278 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2018-11-28 13:09:54,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:09:54,281 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:54,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:54,281 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:54,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:54,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1281163029, now seen corresponding path program 1 times [2018-11-28 13:09:54,282 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:09:54,282 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:09:54,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:09:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:09:55,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:55,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-28 13:09:55,120 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,122 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,123 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 46 [2018-11-28 13:09:55,159 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,161 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:09:55,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-28 13:09:55,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,175 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,214 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:60, output treesize:37 [2018-11-28 13:09:55,244 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,252 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 54 [2018-11-28 13:09:55,259 INFO L478 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 18 treesize of output 16 [2018-11-28 13:09:55,259 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,283 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:37 [2018-11-28 13:09:55,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,388 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 81 [2018-11-28 13:09:55,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,421 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 78 [2018-11-28 13:09:55,423 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:09:55,474 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,489 INFO L267 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. [2018-11-28 13:09:55,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:49 [2018-11-28 13:09:55,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,667 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,669 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,671 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 54 [2018-11-28 13:09:55,698 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 44 [2018-11-28 13:09:55,703 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2018-11-28 13:09:55,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:09:55,759 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,772 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:55,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-11-28 13:09:55,774 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,780 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,786 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:55,787 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:50, output treesize:3 [2018-11-28 13:09:55,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 13:09:55,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:09:56,113 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:09:56,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:09:56,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2018-11-28 13:09:56,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 13:09:56,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 13:09:56,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:09:56,119 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand 22 states. [2018-11-28 13:09:59,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:09:59,562 INFO L93 Difference]: Finished difference Result 482 states and 634 transitions. [2018-11-28 13:09:59,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-28 13:09:59,563 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-11-28 13:09:59,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:09:59,565 INFO L225 Difference]: With dead ends: 482 [2018-11-28 13:09:59,565 INFO L226 Difference]: Without dead ends: 480 [2018-11-28 13:09:59,566 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=381, Invalid=1425, Unknown=0, NotChecked=0, Total=1806 [2018-11-28 13:09:59,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-11-28 13:09:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 254. [2018-11-28 13:09:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-11-28 13:09:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 344 transitions. [2018-11-28 13:09:59,614 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 344 transitions. Word has length 31 [2018-11-28 13:09:59,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:09:59,615 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 344 transitions. [2018-11-28 13:09:59,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 13:09:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 344 transitions. [2018-11-28 13:09:59,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-28 13:09:59,616 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:09:59,616 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:09:59,616 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:09:59,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:09:59,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1972596862, now seen corresponding path program 2 times [2018-11-28 13:09:59,617 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:09:59,617 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:09:59,638 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 13:09:59,792 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-11-28 13:09:59,792 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:09:59,793 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 13:09:59,801 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-28 13:09:59,882 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:09:59,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:09:59,891 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:09:59,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-28 13:09:59,914 INFO L478 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 12 treesize of output 11 [2018-11-28 13:09:59,915 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:59,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:59,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:59,924 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-28 13:09:59,953 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-28 13:09:59,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:09:59,957 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-11-28 13:09:59,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:59,963 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:59,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:59,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-11-28 13:09:59,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-28 13:09:59,990 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-28 13:09:59,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:09:59,991 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:59,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:09:59,993 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-28 13:10:00,015 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:10:00,015 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:10:00,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-28 13:10:00,137 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 24 [2018-11-28 13:10:02,170 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#distance~0.offset|) |main_~#distance~0.offset|) [2018-11-28 13:10:02,171 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:10:02,172 INFO L303 Elim1Store]: Index analysis took 2015 ms [2018-11-28 13:10:02,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-28 13:10:02,173 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:02,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 6 [2018-11-28 13:10:02,176 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:02,183 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:10:02,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:10:02,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:10:02,198 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:22, output treesize:21 [2018-11-28 13:10:02,217 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:10:02,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:02,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-28 13:10:02,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 13:10:02,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:10:02,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:10:02,234 INFO L87 Difference]: Start difference. First operand 254 states and 344 transitions. Second operand 17 states. [2018-11-28 13:10:03,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:03,083 INFO L93 Difference]: Finished difference Result 635 states and 853 transitions. [2018-11-28 13:10:03,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-28 13:10:03,084 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-11-28 13:10:03,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:03,085 INFO L225 Difference]: With dead ends: 635 [2018-11-28 13:10:03,086 INFO L226 Difference]: Without dead ends: 633 [2018-11-28 13:10:03,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2018-11-28 13:10:03,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2018-11-28 13:10:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 326. [2018-11-28 13:10:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-28 13:10:03,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 451 transitions. [2018-11-28 13:10:03,143 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 451 transitions. Word has length 31 [2018-11-28 13:10:03,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:03,143 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 451 transitions. [2018-11-28 13:10:03,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 13:10:03,143 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 451 transitions. [2018-11-28 13:10:03,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-28 13:10:03,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:03,144 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:03,145 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:03,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:03,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1698114635, now seen corresponding path program 1 times [2018-11-28 13:10:03,145 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:10:03,145 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:10:03,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:03,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:03,240 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:03,304 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:10:03,304 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:10:03,372 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:10:03,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:03,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-28 13:10:03,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-28 13:10:03,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-28 13:10:03,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-11-28 13:10:03,375 INFO L87 Difference]: Start difference. First operand 326 states and 451 transitions. Second operand 13 states. [2018-11-28 13:10:03,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:03,713 INFO L93 Difference]: Finished difference Result 516 states and 697 transitions. [2018-11-28 13:10:03,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-28 13:10:03,714 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 33 [2018-11-28 13:10:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:03,715 INFO L225 Difference]: With dead ends: 516 [2018-11-28 13:10:03,715 INFO L226 Difference]: Without dead ends: 376 [2018-11-28 13:10:03,716 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:10:03,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-11-28 13:10:03,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 324. [2018-11-28 13:10:03,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-11-28 13:10:03,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2018-11-28 13:10:03,762 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 33 [2018-11-28 13:10:03,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:03,762 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2018-11-28 13:10:03,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-28 13:10:03,763 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2018-11-28 13:10:03,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-28 13:10:03,763 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:03,764 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:03,764 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:03,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:03,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1142223879, now seen corresponding path program 2 times [2018-11-28 13:10:03,765 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:10:03,765 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:10:03,781 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 13:10:03,960 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:10:03,960 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:03,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:04,044 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:10:04,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:10:04,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:10:04,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:04,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2018-11-28 13:10:04,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-28 13:10:04,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-28 13:10:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:10:04,164 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand 17 states. [2018-11-28 13:10:04,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:04,928 INFO L93 Difference]: Finished difference Result 800 states and 1090 transitions. [2018-11-28 13:10:04,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-28 13:10:04,929 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 34 [2018-11-28 13:10:04,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:04,931 INFO L225 Difference]: With dead ends: 800 [2018-11-28 13:10:04,931 INFO L226 Difference]: Without dead ends: 675 [2018-11-28 13:10:04,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2018-11-28 13:10:04,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-11-28 13:10:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 471. [2018-11-28 13:10:05,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-11-28 13:10:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 633 transitions. [2018-11-28 13:10:05,014 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 633 transitions. Word has length 34 [2018-11-28 13:10:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:05,015 INFO L480 AbstractCegarLoop]: Abstraction has 471 states and 633 transitions. [2018-11-28 13:10:05,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-28 13:10:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 633 transitions. [2018-11-28 13:10:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-28 13:10:05,016 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:05,016 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:05,016 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:05,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:05,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1647290398, now seen corresponding path program 3 times [2018-11-28 13:10:05,017 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:10:05,017 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:10:05,045 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-28 13:10:05,285 ERROR L235 seRefinementStrategy]: Caught known exception: Array theory solver does not yet support write-chains connecting two different constant arrays [2018-11-28 13:10:05,285 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-28 13:10:05,285 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-28 13:10:05,294 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-28 13:10:05,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 13:10:05,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:05,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:05,414 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-11-28 13:10:05,418 INFO L478 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 0 case distinctions, treesize of input 17 treesize of output 19 [2018-11-28 13:10:05,427 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 9 [2018-11-28 13:10:05,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:05,438 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:05,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:05,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:05,466 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:43, output treesize:33 [2018-11-28 13:10:05,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,490 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 48 [2018-11-28 13:10:05,493 INFO L478 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 26 treesize of output 20 [2018-11-28 13:10:05,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:05,514 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:05,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:05,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:42 [2018-11-28 13:10:05,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,636 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,637 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 75 [2018-11-28 13:10:05,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,651 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,673 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 90 [2018-11-28 13:10:05,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:10:05,703 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:05,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:05,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2018-11-28 13:10:05,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,812 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,813 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 80 [2018-11-28 13:10:05,824 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,827 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:05,870 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 139 [2018-11-28 13:10:05,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:10:05,916 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:05,928 INFO L267 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. [2018-11-28 13:10:05,928 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:63, output treesize:59 [2018-11-28 13:10:06,005 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:06,006 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:06,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2018-11-28 13:10:06,013 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:06,021 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 35 [2018-11-28 13:10:06,023 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-28 13:10:06,046 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:06,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 8 [2018-11-28 13:10:06,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:06,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:06,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:06,057 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:59, output treesize:3 [2018-11-28 13:10:06,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:10:06,118 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:10:07,113 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:10:07,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:07,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 31 [2018-11-28 13:10:07,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-28 13:10:07,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-28 13:10:07,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=791, Unknown=0, NotChecked=0, Total=930 [2018-11-28 13:10:07,131 INFO L87 Difference]: Start difference. First operand 471 states and 633 transitions. Second operand 31 states. [2018-11-28 13:10:12,095 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-28 13:10:24,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:24,022 INFO L93 Difference]: Finished difference Result 1443 states and 1875 transitions. [2018-11-28 13:10:24,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-11-28 13:10:24,023 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 37 [2018-11-28 13:10:24,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:24,026 INFO L225 Difference]: With dead ends: 1443 [2018-11-28 13:10:24,026 INFO L226 Difference]: Without dead ends: 1395 [2018-11-28 13:10:24,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3292 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=2019, Invalid=9323, Unknown=0, NotChecked=0, Total=11342 [2018-11-28 13:10:24,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2018-11-28 13:10:24,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 423. [2018-11-28 13:10:24,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-11-28 13:10:24,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 568 transitions. [2018-11-28 13:10:24,135 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 568 transitions. Word has length 37 [2018-11-28 13:10:24,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:24,136 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 568 transitions. [2018-11-28 13:10:24,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-28 13:10:24,136 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 568 transitions. [2018-11-28 13:10:24,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 13:10:24,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:24,136 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:24,137 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:24,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:24,137 INFO L82 PathProgramCache]: Analyzing trace with hash 924685623, now seen corresponding path program 2 times [2018-11-28 13:10:24,137 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:10:24,137 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:10:24,155 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-28 13:10:24,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-28 13:10:24,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:24,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-28 13:10:24,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:10:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 13:10:24,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:24,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-28 13:10:24,326 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:10:24,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:10:24,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-28 13:10:24,326 INFO L87 Difference]: Start difference. First operand 423 states and 568 transitions. Second operand 6 states. [2018-11-28 13:10:24,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:24,518 INFO L93 Difference]: Finished difference Result 741 states and 992 transitions. [2018-11-28 13:10:24,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:10:24,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-11-28 13:10:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:24,520 INFO L225 Difference]: With dead ends: 741 [2018-11-28 13:10:24,520 INFO L226 Difference]: Without dead ends: 355 [2018-11-28 13:10:24,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 13:10:24,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-11-28 13:10:24,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 342. [2018-11-28 13:10:24,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-11-28 13:10:24,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 449 transitions. [2018-11-28 13:10:24,602 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 449 transitions. Word has length 39 [2018-11-28 13:10:24,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:24,603 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 449 transitions. [2018-11-28 13:10:24,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:10:24,603 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 449 transitions. [2018-11-28 13:10:24,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-28 13:10:24,603 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:24,603 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:24,603 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:24,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:24,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1447053639, now seen corresponding path program 1 times [2018-11-28 13:10:24,604 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:10:24,604 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:10:24,616 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:10:24,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:10:24,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:24,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-28 13:10:24,723 INFO L478 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 10 treesize of output 9 [2018-11-28 13:10:24,723 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:24,725 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:24,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:24,727 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-28 13:10:24,778 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-11-28 13:10:24,780 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 5 [2018-11-28 13:10:24,780 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:24,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:24,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:24,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2018-11-28 13:10:24,809 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:10:24,809 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:10:24,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2018-11-28 13:10:24,933 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2018-11-28 13:10:24,934 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:24,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:10:24,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-28 13:10:24,943 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:16, output treesize:11 [2018-11-28 13:10:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:10:25,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:25,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-28 13:10:25,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-28 13:10:25,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-28 13:10:25,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2018-11-28 13:10:25,012 INFO L87 Difference]: Start difference. First operand 342 states and 449 transitions. Second operand 21 states. [2018-11-28 13:10:34,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:34,520 INFO L93 Difference]: Finished difference Result 851 states and 1101 transitions. [2018-11-28 13:10:34,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-28 13:10:34,520 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-11-28 13:10:34,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:34,522 INFO L225 Difference]: With dead ends: 851 [2018-11-28 13:10:34,522 INFO L226 Difference]: Without dead ends: 787 [2018-11-28 13:10:34,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=243, Invalid=1239, Unknown=0, NotChecked=0, Total=1482 [2018-11-28 13:10:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2018-11-28 13:10:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 676. [2018-11-28 13:10:34,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-11-28 13:10:34,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 885 transitions. [2018-11-28 13:10:34,670 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 885 transitions. Word has length 39 [2018-11-28 13:10:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:34,670 INFO L480 AbstractCegarLoop]: Abstraction has 676 states and 885 transitions. [2018-11-28 13:10:34,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-28 13:10:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 885 transitions. [2018-11-28 13:10:34,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 13:10:34,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:34,672 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:34,672 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:34,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:34,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1460763138, now seen corresponding path program 4 times [2018-11-28 13:10:34,672 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:10:34,672 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:10:34,686 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 13:10:34,801 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 13:10:34,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:34,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:10:34,985 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:10:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:10:35,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:35,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2018-11-28 13:10:35,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-28 13:10:35,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-28 13:10:35,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=380, Unknown=0, NotChecked=0, Total=506 [2018-11-28 13:10:35,357 INFO L87 Difference]: Start difference. First operand 676 states and 885 transitions. Second operand 23 states. [2018-11-28 13:10:37,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:37,152 INFO L93 Difference]: Finished difference Result 1754 states and 2281 transitions. [2018-11-28 13:10:37,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-28 13:10:37,153 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 40 [2018-11-28 13:10:37,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:37,156 INFO L225 Difference]: With dead ends: 1754 [2018-11-28 13:10:37,156 INFO L226 Difference]: Without dead ends: 1458 [2018-11-28 13:10:37,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=449, Invalid=1713, Unknown=0, NotChecked=0, Total=2162 [2018-11-28 13:10:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-11-28 13:10:37,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 936. [2018-11-28 13:10:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 936 states. [2018-11-28 13:10:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 936 states to 936 states and 1217 transitions. [2018-11-28 13:10:37,364 INFO L78 Accepts]: Start accepts. Automaton has 936 states and 1217 transitions. Word has length 40 [2018-11-28 13:10:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:37,364 INFO L480 AbstractCegarLoop]: Abstraction has 936 states and 1217 transitions. [2018-11-28 13:10:37,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-28 13:10:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 936 states and 1217 transitions. [2018-11-28 13:10:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-28 13:10:37,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:37,365 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:37,366 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:37,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:37,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1315508773, now seen corresponding path program 3 times [2018-11-28 13:10:37,366 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:10:37,366 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:10:37,379 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-28 13:10:37,542 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-28 13:10:37,542 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:37,545 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:37,875 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 14 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:10:37,875 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:10:38,311 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-28 13:10:38,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:38,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 27 [2018-11-28 13:10:38,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-28 13:10:38,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-28 13:10:38,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2018-11-28 13:10:38,314 INFO L87 Difference]: Start difference. First operand 936 states and 1217 transitions. Second operand 27 states. [2018-11-28 13:10:40,315 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2018-11-28 13:10:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:10:43,180 INFO L93 Difference]: Finished difference Result 2726 states and 3540 transitions. [2018-11-28 13:10:43,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-28 13:10:43,181 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 40 [2018-11-28 13:10:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:10:43,185 INFO L225 Difference]: With dead ends: 2726 [2018-11-28 13:10:43,185 INFO L226 Difference]: Without dead ends: 2443 [2018-11-28 13:10:43,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1193, Invalid=3777, Unknown=0, NotChecked=0, Total=4970 [2018-11-28 13:10:43,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2443 states. [2018-11-28 13:10:43,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2443 to 1774. [2018-11-28 13:10:43,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1774 states. [2018-11-28 13:10:43,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1774 states to 1774 states and 2341 transitions. [2018-11-28 13:10:43,642 INFO L78 Accepts]: Start accepts. Automaton has 1774 states and 2341 transitions. Word has length 40 [2018-11-28 13:10:43,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:10:43,642 INFO L480 AbstractCegarLoop]: Abstraction has 1774 states and 2341 transitions. [2018-11-28 13:10:43,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-28 13:10:43,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1774 states and 2341 transitions. [2018-11-28 13:10:43,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 13:10:43,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:10:43,644 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:10:43,644 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:10:43,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:10:43,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1598984565, now seen corresponding path program 5 times [2018-11-28 13:10:43,644 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:10:43,644 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:10:43,657 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-28 13:10:47,057 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-28 13:10:47,057 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:10:47,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:10:47,077 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-11-28 13:10:47,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,094 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 44 [2018-11-28 13:10:47,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,125 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:10:47,126 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-28 13:10:47,126 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:47,135 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:47,143 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:47,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:47,173 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:72, output treesize:55 [2018-11-28 13:10:47,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,215 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2018-11-28 13:10:47,223 INFO L478 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 18 treesize of output 16 [2018-11-28 13:10:47,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:47,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:47,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:47,267 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:67, output treesize:59 [2018-11-28 13:10:47,369 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,380 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 132 [2018-11-28 13:10:47,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,423 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 98 [2018-11-28 13:10:47,424 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:10:47,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:47,500 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:47,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:85, output treesize:77 [2018-11-28 13:10:47,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,643 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,652 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,656 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,666 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 158 [2018-11-28 13:10:47,682 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,688 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,704 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:47,833 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 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 9 case distinctions, treesize of input 100 treesize of output 222 [2018-11-28 13:10:47,837 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-11-28 13:10:48,001 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:48,038 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:48,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:105, output treesize:101 [2018-11-28 13:10:48,315 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,324 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,350 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 162 [2018-11-28 13:10:48,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,517 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,541 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,612 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,624 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:48,713 INFO L303 Elim1Store]: Index analysis took 338 ms [2018-11-28 13:10:48,855 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 104 treesize of output 271 [2018-11-28 13:10:48,859 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 7 xjuncts. [2018-11-28 13:10:49,000 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:49,036 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:49,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:110, output treesize:106 [2018-11-28 13:10:49,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,448 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,449 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 90 treesize of output 90 [2018-11-28 13:10:49,461 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,479 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,485 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,564 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 176 [2018-11-28 13:10:49,564 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-28 13:10:49,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 54 dim-0 vars, End of recursive call: 54 dim-0 vars, and 31 xjuncts. [2018-11-28 13:10:49,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,775 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,776 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:10:49,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2018-11-28 13:10:49,777 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:49,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-28 13:10:49,787 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:10:49,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:49,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:10:49,799 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:90, output treesize:3 [2018-11-28 13:10:49,896 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:10:49,896 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:10:52,957 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 13:10:52,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:10:52,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2018-11-28 13:10:52,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-28 13:10:52,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-28 13:10:52,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1077, Unknown=0, NotChecked=0, Total=1260 [2018-11-28 13:10:52,976 INFO L87 Difference]: Start difference. First operand 1774 states and 2341 transitions. Second operand 36 states. [2018-11-28 13:10:54,113 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2018-11-28 13:10:58,513 WARN L180 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2018-11-28 13:11:03,115 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-28 13:11:07,765 WARN L180 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2018-11-28 13:11:08,452 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-11-28 13:11:14,844 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 71 [2018-11-28 13:11:21,621 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-11-28 13:11:21,804 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2018-11-28 13:11:26,202 WARN L180 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-11-28 13:11:26,427 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2018-11-28 13:11:31,374 WARN L180 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 57 [2018-11-28 13:11:31,572 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 51 [2018-11-28 13:11:33,089 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2018-11-28 13:11:33,718 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 62 [2018-11-28 13:11:34,049 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2018-11-28 13:11:39,452 WARN L180 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-11-28 13:11:39,809 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-11-28 13:11:40,496 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-11-28 13:11:41,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:41,424 INFO L93 Difference]: Finished difference Result 2380 states and 3101 transitions. [2018-11-28 13:11:41,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-11-28 13:11:41,425 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 43 [2018-11-28 13:11:41,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:41,428 INFO L225 Difference]: With dead ends: 2380 [2018-11-28 13:11:41,428 INFO L226 Difference]: Without dead ends: 2338 [2018-11-28 13:11:41,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 51 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2321 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=1203, Invalid=6987, Unknown=0, NotChecked=0, Total=8190 [2018-11-28 13:11:41,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2338 states. [2018-11-28 13:11:41,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2338 to 2022. [2018-11-28 13:11:41,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2018-11-28 13:11:41,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 2659 transitions. [2018-11-28 13:11:41,930 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 2659 transitions. Word has length 43 [2018-11-28 13:11:41,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:41,930 INFO L480 AbstractCegarLoop]: Abstraction has 2022 states and 2659 transitions. [2018-11-28 13:11:41,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-28 13:11:41,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 2659 transitions. [2018-11-28 13:11:41,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 13:11:41,932 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:41,932 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:41,932 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:41,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:41,932 INFO L82 PathProgramCache]: Analyzing trace with hash 2029454596, now seen corresponding path program 4 times [2018-11-28 13:11:41,932 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:11:41,932 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:11:41,962 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-28 13:11:41,993 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-28 13:11:41,993 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:11:41,995 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:11:42,041 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 13:11:42,042 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:11:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-28 13:11:42,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:11:42,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-28 13:11:42,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-28 13:11:42,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-28 13:11:42,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-11-28 13:11:42,117 INFO L87 Difference]: Start difference. First operand 2022 states and 2659 transitions. Second operand 12 states. [2018-11-28 13:11:43,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:43,975 INFO L93 Difference]: Finished difference Result 4010 states and 5259 transitions. [2018-11-28 13:11:43,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-28 13:11:43,975 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2018-11-28 13:11:43,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:43,979 INFO L225 Difference]: With dead ends: 4010 [2018-11-28 13:11:43,979 INFO L226 Difference]: Without dead ends: 2828 [2018-11-28 13:11:43,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=171, Unknown=0, NotChecked=0, Total=272 [2018-11-28 13:11:43,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2828 states. [2018-11-28 13:11:44,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2828 to 1906. [2018-11-28 13:11:44,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1906 states. [2018-11-28 13:11:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2507 transitions. [2018-11-28 13:11:44,456 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2507 transitions. Word has length 43 [2018-11-28 13:11:44,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:44,456 INFO L480 AbstractCegarLoop]: Abstraction has 1906 states and 2507 transitions. [2018-11-28 13:11:44,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-28 13:11:44,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2507 transitions. [2018-11-28 13:11:44,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-28 13:11:44,457 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:44,457 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:44,457 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:44,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:44,457 INFO L82 PathProgramCache]: Analyzing trace with hash 199262750, now seen corresponding path program 5 times [2018-11-28 13:11:44,458 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:11:44,458 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:11:44,481 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-28 13:11:44,584 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-28 13:11:44,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:11:44,587 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:11:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 13 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 13:11:44,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:11:44,893 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 19 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-28 13:11:44,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:11:44,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2018-11-28 13:11:44,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-28 13:11:44,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-28 13:11:44,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2018-11-28 13:11:44,896 INFO L87 Difference]: Start difference. First operand 1906 states and 2507 transitions. Second operand 18 states. [2018-11-28 13:11:46,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:46,204 INFO L93 Difference]: Finished difference Result 2651 states and 3449 transitions. [2018-11-28 13:11:46,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-28 13:11:46,205 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 43 [2018-11-28 13:11:46,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:46,206 INFO L225 Difference]: With dead ends: 2651 [2018-11-28 13:11:46,206 INFO L226 Difference]: Without dead ends: 1040 [2018-11-28 13:11:46,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=324, Invalid=1008, Unknown=0, NotChecked=0, Total=1332 [2018-11-28 13:11:46,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2018-11-28 13:11:46,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 852. [2018-11-28 13:11:46,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 852 states. [2018-11-28 13:11:46,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 852 states to 852 states and 1078 transitions. [2018-11-28 13:11:46,461 INFO L78 Accepts]: Start accepts. Automaton has 852 states and 1078 transitions. Word has length 43 [2018-11-28 13:11:46,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:46,461 INFO L480 AbstractCegarLoop]: Abstraction has 852 states and 1078 transitions. [2018-11-28 13:11:46,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-28 13:11:46,461 INFO L276 IsEmpty]: Start isEmpty. Operand 852 states and 1078 transitions. [2018-11-28 13:11:46,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-28 13:11:46,462 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:46,463 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:46,463 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:46,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:46,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2061264985, now seen corresponding path program 6 times [2018-11-28 13:11:46,463 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:11:46,463 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/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 [2018-11-28 13:11:46,489 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-11-28 13:11:46,785 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-11-28 13:11:46,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-28 13:11:46,789 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:11:46,894 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:11:46,894 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:11:47,132 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 24 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-28 13:11:47,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:11:47,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-28 13:11:47,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-28 13:11:47,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-28 13:11:47,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2018-11-28 13:11:47,136 INFO L87 Difference]: Start difference. First operand 852 states and 1078 transitions. Second operand 22 states. [2018-11-28 13:11:50,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:11:50,490 INFO L93 Difference]: Finished difference Result 1611 states and 2001 transitions. [2018-11-28 13:11:50,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-28 13:11:50,492 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 46 [2018-11-28 13:11:50,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:11:50,494 INFO L225 Difference]: With dead ends: 1611 [2018-11-28 13:11:50,494 INFO L226 Difference]: Without dead ends: 1396 [2018-11-28 13:11:50,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 793 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=533, Invalid=2659, Unknown=0, NotChecked=0, Total=3192 [2018-11-28 13:11:50,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2018-11-28 13:11:50,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 908. [2018-11-28 13:11:50,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 908 states. [2018-11-28 13:11:50,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 908 states to 908 states and 1132 transitions. [2018-11-28 13:11:50,796 INFO L78 Accepts]: Start accepts. Automaton has 908 states and 1132 transitions. Word has length 46 [2018-11-28 13:11:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:11:50,796 INFO L480 AbstractCegarLoop]: Abstraction has 908 states and 1132 transitions. [2018-11-28 13:11:50,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-28 13:11:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 908 states and 1132 transitions. [2018-11-28 13:11:50,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 13:11:50,798 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:11:50,798 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:11:50,798 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:11:50,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:11:50,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1112882494, now seen corresponding path program 1 times [2018-11-28 13:11:50,799 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:11:50,799 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/cvc4 Starting monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:11:50,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-28 13:11:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:11:51,975 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:11:52,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,044 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,045 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-28 13:11:52,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,074 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:52,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2018-11-28 13:11:52,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,108 INFO L683 Elim1Store]: detected equality via solver [2018-11-28 13:11:52,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-28 13:11:52,109 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,127 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,152 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,152 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:70, output treesize:55 [2018-11-28 13:11:52,187 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,188 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,193 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,206 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,207 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 89 [2018-11-28 13:11:52,214 INFO L478 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 26 treesize of output 20 [2018-11-28 13:11:52,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:62 [2018-11-28 13:11:52,343 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,345 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,347 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,353 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 96 [2018-11-28 13:11:52,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,408 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 52 [2018-11-28 13:11:52,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:11:52,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:55 [2018-11-28 13:11:52,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,627 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,633 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 108 [2018-11-28 13:11:52,649 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,657 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,673 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 78 [2018-11-28 13:11:52,674 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:11:52,732 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,758 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2018-11-28 13:11:52,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 93 [2018-11-28 13:11:52,888 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 18 [2018-11-28 13:11:52,889 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-28 13:11:52,935 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2018-11-28 13:11:52,935 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,957 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-28 13:11:52,958 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 21 [2018-11-28 13:11:52,959 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,978 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2018-11-28 13:11:52,978 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-28 13:11:52,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:53,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-28 13:11:53,007 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:91, output treesize:12 [2018-11-28 13:11:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-28 13:11:53,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-28 13:12:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-28 13:12:02,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-28 13:12:02,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-28 13:12:02,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-28 13:12:02,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-28 13:12:02,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=309, Unknown=2, NotChecked=0, Total=380 [2018-11-28 13:12:02,834 INFO L87 Difference]: Start difference. First operand 908 states and 1132 transitions. Second operand 20 states. [2018-11-28 13:12:04,353 WARN L180 SmtUtils]: Spent 855.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2018-11-28 13:12:09,094 WARN L180 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 134 DAG size of output: 117 [2018-11-28 13:12:09,477 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2018-11-28 13:12:10,577 WARN L180 SmtUtils]: Spent 606.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 94 [2018-11-28 13:12:11,182 WARN L180 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2018-11-28 13:12:30,173 WARN L180 SmtUtils]: Spent 11.75 s on a formula simplification that was a NOOP. DAG size: 144 [2018-11-28 13:12:44,171 WARN L180 SmtUtils]: Spent 10.49 s on a formula simplification that was a NOOP. DAG size: 113 [2018-11-28 13:13:01,521 WARN L180 SmtUtils]: Spent 12.88 s on a formula simplification that was a NOOP. DAG size: 167 [2018-11-28 13:13:03,090 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 116 DAG size of output: 92 [2018-11-28 13:13:05,640 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse21 (bvmul (_ bv4 32) c_main_~j~0)) (.cse22 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse6 (bvadd (bvmul (_ bv4 32) (select .cse22 |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (.cse3 (bvadd (bvmul (_ bv4 32) (select .cse22 (bvadd |c_main_~#Dest~0.offset| .cse21))) |c_main_~#distance~0.offset|)) (.cse17 (select |c_#memory_int| |c_main_~#Weight~0.base|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|)) (.cse16 (select |c_#memory_int| |c_main_~#Source~0.base|))) (and (not (let ((.cse0 (store .cse2 .cse3 (_ bv4294967295 32)))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0))) (bvsgt (select .cse0 (bvadd |c_main_~#distance~0.offset| (bvmul (_ bv4 32) (select (select .cse1 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)))) (bvadd (select .cse0 (bvadd (bvmul (_ bv4 32) (select (select .cse1 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse1 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|)))))) (not (let ((.cse4 (store .cse2 .cse6 (_ bv4294967295 32)))) (let ((.cse5 (store |c_#memory_int| |c_main_~#distance~0.base| .cse4))) (bvsgt (select .cse4 (bvadd (bvmul (_ bv4 32) (select (select .cse5 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (bvadd (select .cse4 (bvadd (bvmul (_ bv4 32) (select (select .cse5 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse5 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|)))))) (not (let ((.cse7 (store .cse2 (bvadd (bvmul (_ bv4 32) c_main_~x~0) |c_main_~#distance~0.offset|) (_ bv4294967295 32)))) (let ((.cse8 (store |c_#memory_int| |c_main_~#distance~0.base| .cse7))) (bvsgt (select .cse7 (bvadd (bvmul (_ bv4 32) (select (select .cse8 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (bvadd (select .cse7 (bvadd (bvmul (_ bv4 32) (select (select .cse8 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse8 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|)))))) (forall ((~INFINITY~0 (_ BitVec 32))) (not (let ((.cse9 (let ((.cse11 (let ((.cse12 (bvmul (_ bv4 32) c_main_~i~0))) (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (bvadd .cse12 |c_main_~#distance~0.offset|) (_ bv0 32)) (bvadd .cse12 |c_main_~#distance~0.offset| (_ bv4 32)) ~INFINITY~0)))) (store .cse11 (bvadd (bvmul (_ bv4 32) (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse11) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|) (_ bv4294967295 32))))) (let ((.cse10 (store |c_#memory_int| |c_main_~#distance~0.base| .cse9))) (bvsgt (select .cse9 (bvadd (bvmul (_ bv4 32) (select (select .cse10 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (bvadd (select .cse9 (bvadd (bvmul (_ bv4 32) (select (select .cse10 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse10 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|))))))) (forall ((~INFINITY~0 (_ BitVec 32))) (not (let ((.cse13 (let ((.cse15 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (bvadd (bvmul (_ bv4 32) c_main_~i~0) |c_main_~#distance~0.offset| (_ bv4 32)) ~INFINITY~0))) (store .cse15 (bvadd (bvmul (_ bv4 32) (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse15) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|) (_ bv4294967295 32))))) (let ((.cse14 (store |c_#memory_int| |c_main_~#distance~0.base| .cse13))) (bvsgt (select .cse13 (bvadd (bvmul (_ bv4 32) (select (select .cse14 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (bvadd (select .cse13 (bvadd (bvmul (_ bv4 32) (select (select .cse14 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse14 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|))))))) (not (bvsgt (select .cse2 .cse6) (bvadd (select .cse2 (bvadd (bvmul (_ bv4 32) (select .cse16 |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select .cse17 |c_main_~#Weight~0.offset|)))) (forall ((~INFINITY~0 (_ BitVec 32))) (not (let ((.cse18 (let ((.cse20 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (bvadd (bvmul (_ bv4 32) c_main_~i~0) |c_main_~#distance~0.offset|) ~INFINITY~0))) (store .cse20 (bvadd (bvmul (_ bv4 32) (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse20) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|) (_ bv4294967295 32))))) (let ((.cse19 (store |c_#memory_int| |c_main_~#distance~0.base| .cse18))) (bvsgt (select .cse18 (bvadd (bvmul (_ bv4 32) (select (select .cse19 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (bvadd (select .cse18 (bvadd (bvmul (_ bv4 32) (select (select .cse19 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse19 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|))))))) (not (bvsgt (select .cse2 .cse3) (bvadd (select .cse17 (bvadd |c_main_~#Weight~0.offset| .cse21)) (select .cse2 (bvadd |c_main_~#distance~0.offset| (bvmul (_ bv4 32) (select .cse16 (bvadd |c_main_~#Source~0.offset| .cse21))))))))))) is different from true [2018-11-28 13:13:20,778 WARN L180 SmtUtils]: Spent 10.83 s on a formula simplification that was a NOOP. DAG size: 136 [2018-11-28 13:13:41,311 WARN L180 SmtUtils]: Spent 12.86 s on a formula simplification that was a NOOP. DAG size: 156 [2018-11-28 13:13:55,226 WARN L180 SmtUtils]: Spent 7.53 s on a formula simplification that was a NOOP. DAG size: 124 [2018-11-28 13:13:56,948 WARN L180 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 118 DAG size of output: 94 [2018-11-28 13:13:58,743 WARN L180 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 98 [2018-11-28 13:14:17,096 WARN L180 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 124 DAG size of output: 100 [2018-11-28 13:14:44,125 WARN L180 SmtUtils]: Spent 16.57 s on a formula simplification that was a NOOP. DAG size: 158 [2018-11-28 13:14:57,982 WARN L180 SmtUtils]: Spent 7.67 s on a formula simplification that was a NOOP. DAG size: 133 [2018-11-28 13:15:00,609 WARN L180 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 116 DAG size of output: 92 [2018-11-28 13:15:07,911 WARN L180 SmtUtils]: Spent 440.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-11-28 13:15:10,550 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse21 (bvmul (_ bv4 32) c_main_~j~0)) (.cse22 (select |c_#memory_int| |c_main_~#Dest~0.base|))) (let ((.cse6 (bvadd (bvmul (_ bv4 32) (select .cse22 |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (.cse3 (bvadd (bvmul (_ bv4 32) (select .cse22 (bvadd |c_main_~#Dest~0.offset| .cse21))) |c_main_~#distance~0.offset|)) (.cse17 (select |c_#memory_int| |c_main_~#Weight~0.base|)) (.cse2 (select |c_#memory_int| |c_main_~#distance~0.base|)) (.cse16 (select |c_#memory_int| |c_main_~#Source~0.base|))) (and (not (let ((.cse0 (store .cse2 .cse3 (_ bv4294967295 32)))) (let ((.cse1 (store |c_#memory_int| |c_main_~#distance~0.base| .cse0))) (bvsgt (select .cse0 (bvadd |c_main_~#distance~0.offset| (bvmul (_ bv4 32) (select (select .cse1 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)))) (bvadd (select .cse0 (bvadd (bvmul (_ bv4 32) (select (select .cse1 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse1 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|)))))) (not (let ((.cse4 (store .cse2 .cse6 (_ bv4294967295 32)))) (let ((.cse5 (store |c_#memory_int| |c_main_~#distance~0.base| .cse4))) (bvsgt (select .cse4 (bvadd (bvmul (_ bv4 32) (select (select .cse5 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (bvadd (select .cse4 (bvadd (bvmul (_ bv4 32) (select (select .cse5 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse5 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|)))))) (not (bvsgt |c_main_#t~mem10| (bvadd |c_main_#t~mem9| |c_main_#t~mem8|))) (not (let ((.cse7 (store .cse2 (bvadd (bvmul (_ bv4 32) c_main_~x~0) |c_main_~#distance~0.offset|) (_ bv4294967295 32)))) (let ((.cse8 (store |c_#memory_int| |c_main_~#distance~0.base| .cse7))) (bvsgt (select .cse7 (bvadd (bvmul (_ bv4 32) (select (select .cse8 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (bvadd (select .cse7 (bvadd (bvmul (_ bv4 32) (select (select .cse8 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse8 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|)))))) (forall ((~INFINITY~0 (_ BitVec 32))) (not (let ((.cse9 (let ((.cse11 (let ((.cse12 (bvmul (_ bv4 32) c_main_~i~0))) (store (store (select |c_#memory_int| |c_main_~#distance~0.base|) (bvadd .cse12 |c_main_~#distance~0.offset|) (_ bv0 32)) (bvadd .cse12 |c_main_~#distance~0.offset| (_ bv4 32)) ~INFINITY~0)))) (store .cse11 (bvadd (bvmul (_ bv4 32) (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse11) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|) (_ bv4294967295 32))))) (let ((.cse10 (store |c_#memory_int| |c_main_~#distance~0.base| .cse9))) (bvsgt (select .cse9 (bvadd (bvmul (_ bv4 32) (select (select .cse10 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (bvadd (select .cse9 (bvadd (bvmul (_ bv4 32) (select (select .cse10 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse10 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|))))))) (forall ((~INFINITY~0 (_ BitVec 32))) (not (let ((.cse13 (let ((.cse15 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (bvadd (bvmul (_ bv4 32) c_main_~i~0) |c_main_~#distance~0.offset| (_ bv4 32)) ~INFINITY~0))) (store .cse15 (bvadd (bvmul (_ bv4 32) (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse15) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|) (_ bv4294967295 32))))) (let ((.cse14 (store |c_#memory_int| |c_main_~#distance~0.base| .cse13))) (bvsgt (select .cse13 (bvadd (bvmul (_ bv4 32) (select (select .cse14 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (bvadd (select .cse13 (bvadd (bvmul (_ bv4 32) (select (select .cse14 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse14 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|))))))) (not (bvsgt (select .cse2 .cse6) (bvadd (select .cse2 (bvadd (bvmul (_ bv4 32) (select .cse16 |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select .cse17 |c_main_~#Weight~0.offset|)))) (forall ((~INFINITY~0 (_ BitVec 32))) (not (let ((.cse18 (let ((.cse20 (store (select |c_#memory_int| |c_main_~#distance~0.base|) (bvadd (bvmul (_ bv4 32) c_main_~i~0) |c_main_~#distance~0.offset|) ~INFINITY~0))) (store .cse20 (bvadd (bvmul (_ bv4 32) (select (select (store |c_#memory_int| |c_main_~#distance~0.base| .cse20) |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|) (_ bv4294967295 32))))) (let ((.cse19 (store |c_#memory_int| |c_main_~#distance~0.base| .cse18))) (bvsgt (select .cse18 (bvadd (bvmul (_ bv4 32) (select (select .cse19 |c_main_~#Dest~0.base|) |c_main_~#Dest~0.offset|)) |c_main_~#distance~0.offset|)) (bvadd (select .cse18 (bvadd (bvmul (_ bv4 32) (select (select .cse19 |c_main_~#Source~0.base|) |c_main_~#Source~0.offset|)) |c_main_~#distance~0.offset|)) (select (select .cse19 |c_main_~#Weight~0.base|) |c_main_~#Weight~0.offset|))))))) (not (bvsgt (select .cse2 .cse3) (bvadd (select .cse17 (bvadd |c_main_~#Weight~0.offset| .cse21)) (select .cse2 (bvadd |c_main_~#distance~0.offset| (bvmul (_ bv4 32) (select .cse16 (bvadd |c_main_~#Source~0.offset| .cse21))))))))))) is different from false [2018-11-28 13:15:13,029 WARN L180 SmtUtils]: Spent 1.34 s on a formula simplification. DAG size of input: 120 DAG size of output: 96 [2018-11-28 13:15:17,022 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-11-28 13:15:24,289 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 131 DAG size of output: 107 [2018-11-28 13:15:46,095 WARN L180 SmtUtils]: Spent 5.79 s on a formula simplification that was a NOOP. DAG size: 116 [2018-11-28 13:15:53,413 WARN L180 SmtUtils]: Spent 2.40 s on a formula simplification that was a NOOP. DAG size: 62 [2018-11-28 13:16:01,391 WARN L180 SmtUtils]: Spent 2.25 s on a formula simplification that was a NOOP. DAG size: 99 [2018-11-28 13:16:03,157 WARN L180 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 122 DAG size of output: 98 [2018-11-28 13:16:06,071 WARN L180 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-28 13:16:08,645 WARN L180 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 79 [2018-11-28 13:16:14,483 WARN L180 SmtUtils]: Spent 2.42 s on a formula simplification that was a NOOP. DAG size: 93 [2018-11-28 13:16:23,000 WARN L180 SmtUtils]: Spent 3.84 s on a formula simplification that was a NOOP. DAG size: 105 [2018-11-28 13:16:27,785 WARN L180 SmtUtils]: Spent 779.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2018-11-28 13:16:31,512 WARN L180 SmtUtils]: Spent 2.33 s on a formula simplification that was a NOOP. DAG size: 73 [2018-11-28 13:16:38,504 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-28 13:16:39,137 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2018-11-28 13:16:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:16:47,326 INFO L93 Difference]: Finished difference Result 3058 states and 3745 transitions. [2018-11-28 13:16:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-28 13:16:47,329 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 48 [2018-11-28 13:16:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:16:47,333 INFO L225 Difference]: With dead ends: 3058 [2018-11-28 13:16:47,333 INFO L226 Difference]: Without dead ends: 2697 [2018-11-28 13:16:47,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2180 ImplicationChecksByTransitivity, 221.1s TimeCoverageRelationStatistics Valid=1280, Invalid=5037, Unknown=11, NotChecked=314, Total=6642 [2018-11-28 13:16:47,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2018-11-28 13:16:47,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1247. [2018-11-28 13:16:47,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1247 states. [2018-11-28 13:16:47,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1247 states to 1247 states and 1553 transitions. [2018-11-28 13:16:47,915 INFO L78 Accepts]: Start accepts. Automaton has 1247 states and 1553 transitions. Word has length 48 [2018-11-28 13:16:47,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:16:47,915 INFO L480 AbstractCegarLoop]: Abstraction has 1247 states and 1553 transitions. [2018-11-28 13:16:47,915 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-28 13:16:47,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1247 states and 1553 transitions. [2018-11-28 13:16:47,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-28 13:16:47,916 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:16:47,916 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:16:47,916 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:16:47,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:16:47,916 INFO L82 PathProgramCache]: Analyzing trace with hash 978868988, now seen corresponding path program 1 times [2018-11-28 13:16:47,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-28 13:16:47,917 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-11-28 13:16:47,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:16:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:16:50,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:16:50,957 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:16:51,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:16:51 BoogieIcfgContainer [2018-11-28 13:16:51,005 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:16:51,006 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:16:51,006 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:16:51,006 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:16:51,008 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:09:51" (3/4) ... [2018-11-28 13:16:51,011 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-11-28 13:16:51,066 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5f331ce0-96fa-42a4-8720-8496cd956bc1/bin-2019/uautomizer/witness.graphml [2018-11-28 13:16:51,066 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:16:51,067 INFO L168 Benchmark]: Toolchain (without parser) took 420415.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 213.9 MB). Free memory was 943.4 MB in the beginning and 864.9 MB in the end (delta: 78.5 MB). Peak memory consumption was 292.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:16:51,067 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:16:51,067 INFO L168 Benchmark]: CACSL2BoogieTranslator took 202.03 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 927.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:16:51,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 20.51 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:16:51,068 INFO L168 Benchmark]: Boogie Preprocessor took 71.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -203.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:16:51,068 INFO L168 Benchmark]: RCFGBuilder took 293.57 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:16:51,068 INFO L168 Benchmark]: TraceAbstraction took 419764.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 873.1 MB in the end (delta: 232.3 MB). Peak memory consumption was 304.1 MB. Max. memory is 11.5 GB. [2018-11-28 13:16:51,068 INFO L168 Benchmark]: Witness Printer took 60.56 ms. Allocated memory is still 1.2 GB. Free memory was 873.1 MB in the beginning and 864.9 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:16:51,070 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 202.03 ms. Allocated memory is still 1.0 GB. Free memory was 943.4 MB in the beginning and 927.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 20.51 ms. Allocated memory is still 1.0 GB. Free memory is still 927.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 71.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 927.3 MB in the beginning and 1.1 GB in the end (delta: -203.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 293.57 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: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 419764.28 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 873.1 MB in the end (delta: 232.3 MB). Peak memory consumption was 304.1 MB. Max. memory is 11.5 GB. * Witness Printer took 60.56 ms. Allocated memory is still 1.2 GB. Free memory was 873.1 MB in the beginning and 864.9 MB in the end (delta: 8.2 MB). Peak memory consumption was 8.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L11] int INFINITY = 899; VAL [\old(INFINITY)=0, INFINITY=899] [L13] int nodecount = __VERIFIER_nondet_int(); [L14] int edgecount = __VERIFIER_nondet_int(); [L15] COND FALSE !(!(0 <= nodecount && nodecount <= 4)) VAL [edgecount=1, INFINITY=899, nodecount=2] [L16] COND FALSE !(!(0 <= edgecount && edgecount <= 19)) [L17] int source = 0; [L18] int Source[20] = {0,4,1,1,0,0,1,3,4,4,2,2,3,0,0,3,1,2,2,3}; [L19] int Dest[20] = {1,3,4,1,1,4,3,4,3,0,0,0,0,2,3,0,2,1,0,4}; [L20] int Weight[20] = {0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19}; [L21] int distance[5]; [L22] int x,y; [L23] int i,j; [L25] i = 0 VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={14:0}, source=0, Weight={15:0}] [L25] COND TRUE i < nodecount VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={14:0}, source=0, Weight={15:0}] [L26] COND TRUE i == source [L27] distance[i] = 0 VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, source=0, Source={14:0}, Weight={15:0}] [L25] i++ VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={14:0}, Weight={15:0}] [L25] COND TRUE i < nodecount VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={14:0}, Weight={15:0}] [L26] COND FALSE !(i == source) [L30] distance[i] = INFINITY VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=1, INFINITY=899, nodecount=2, source=0, Source={14:0}, Weight={15:0}] [L25] i++ VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, source=0, Source={14:0}, Weight={15:0}] [L25] COND FALSE !(i < nodecount) VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=2, INFINITY=899, nodecount=2, Source={14:0}, source=0, Weight={15:0}] [L34] i = 0 VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=0, INFINITY=899, nodecount=2, Source={14:0}, source=0, Weight={15:0}] [L34] COND TRUE i < nodecount [L36] j = 0 VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, source=0, Source={14:0}, Weight={15:0}] [L36] COND TRUE j < edgecount [L38] EXPR Dest[j] [L38] x = Dest[j] [L39] EXPR Source[j] [L39] y = Source[j] [L40] EXPR distance[x] [L40] EXPR distance[y] [L40] EXPR Weight[j] VAL [Dest={11:0}, distance={10:0}, distance[x]=899, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={14:0}, source=0, Weight={15:0}, Weight[j]=0, x=1, y=0] [L40] COND TRUE distance[x] > distance[y] + Weight[j] [L42] distance[x] = -1 VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=0, INFINITY=899, j=0, nodecount=2, Source={14:0}, source=0, Weight={15:0}, x=1, y=0] [L36] j++ VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={14:0}, Weight={15:0}, x=1, y=0] [L36] COND FALSE !(j < edgecount) VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={14:0}, Weight={15:0}, x=1, y=0] [L34] i++ VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={14:0}, source=0, Weight={15:0}, x=1, y=0] [L34] COND TRUE i < nodecount [L36] j = 0 VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, Source={14:0}, source=0, Weight={15:0}, x=1, y=0] [L36] COND TRUE j < edgecount [L38] EXPR Dest[j] [L38] x = Dest[j] [L39] EXPR Source[j] [L39] y = Source[j] [L40] EXPR distance[x] [L40] EXPR distance[y] [L40] EXPR Weight[j] VAL [Dest={11:0}, distance={10:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=1, INFINITY=899, j=0, nodecount=2, Source={14:0}, source=0, Weight={15:0}, Weight[j]=0, x=1, y=0] [L40] COND FALSE !(distance[x] > distance[y] + Weight[j]) [L36] j++ VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={14:0}, Weight={15:0}, x=1, y=0] [L36] COND FALSE !(j < edgecount) VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={14:0}, Weight={15:0}, x=1, y=0] [L34] i++ VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={14:0}, Weight={15:0}, x=1, y=0] [L34] COND FALSE !(i < nodecount) VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=2, INFINITY=899, j=1, nodecount=2, source=0, Source={14:0}, Weight={15:0}, x=1, y=0] [L46] i = 0 VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={14:0}, source=0, Weight={15:0}, x=1, y=0] [L46] COND TRUE i < edgecount [L48] EXPR Dest[i] [L48] x = Dest[i] [L49] EXPR Source[i] [L49] y = Source[i] [L50] EXPR distance[x] [L50] EXPR distance[y] [L50] EXPR Weight[i] VAL [Dest={11:0}, distance={10:0}, distance[x]=-1, distance[y]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={14:0}, source=0, Weight={15:0}, Weight[i]=0, x=1, y=0] [L50] COND FALSE !(distance[x] > distance[y] + Weight[i]) [L46] i++ VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={14:0}, source=0, Weight={15:0}, x=1, y=0] [L46] COND FALSE !(i < edgecount) VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={14:0}, source=0, Weight={15:0}, x=1, y=0] [L56] i = 0 VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={14:0}, source=0, Weight={15:0}, x=1, y=0] [L56] COND TRUE i < nodecount [L58] EXPR distance[i] VAL [Dest={11:0}, distance={10:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, source=0, Source={14:0}, Weight={15:0}, x=1, y=0] [L58] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=1, INFINITY=899] [L6] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, INFINITY=899] [L58] RET __VERIFIER_assert(distance[i]>=0) VAL [Dest={11:0}, distance={10:0}, distance[i]=0, edgecount=1, i=0, INFINITY=899, j=1, nodecount=2, Source={14:0}, source=0, Weight={15:0}, x=1, y=0] [L56] i++ VAL [Dest={11:0}, distance={10:0}, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, source=0, Source={14:0}, Weight={15:0}, x=1, y=0] [L56] COND TRUE i < nodecount [L58] EXPR distance[i] VAL [Dest={11:0}, distance={10:0}, distance[i]=-1, edgecount=1, i=1, INFINITY=899, j=1, nodecount=2, Source={14:0}, source=0, Weight={15:0}, x=1, y=0] [L58] CALL __VERIFIER_assert(distance[i]>=0) VAL [\old(cond)=0, INFINITY=899] [L6] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, INFINITY=899] [L7] __VERIFIER_error() VAL [\old(cond)=0, cond=0, INFINITY=899] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. UNSAFE Result, 419.7s OverallTime, 20 OverallIterations, 6 TraceHistogramMax, 379.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1153 SDtfs, 6657 SDslu, 7397 SDs, 0 SdLazy, 10988 SolverSat, 3810 SolverUnsat, 33 SolverUnknown, 0 SolverNotchecked, 124.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1690 GetRequests, 978 SyntacticMatches, 8 SemanticMatches, 704 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 11722 ImplicationChecksByTransitivity, 264.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2022occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 6691 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 8.3s SatisfiabilityAnalysisTime, 25.3s InterpolantComputationTime, 720 NumberOfCodeBlocks, 714 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1264 ConstructedInterpolants, 69 QuantifiedInterpolants, 617672 SizeOfPredicates, 148 NumberOfNonLiveVariables, 2830 ConjunctsInSsa, 234 ConjunctsInUnsatCore, 36 InterpolantComputations, 2 PerfectInterpolantSequences, 292/652 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...